Logical vs. Physical Data representation?
My C++ Data Structures professor keeps talking about a logical vs. physical representation of data when describing different structures.
I must have missed the day he went over this, because it's a little hard for me to get what he's trying to say.
Maybe I'm looking at it too hard, but all the structures we've learned so far ( list, stack, queue, binary tree, etc ) all seem to have pretty straight-forward representations in code. The only data structure we have encountered that has a different C++ representation are child-sibling trees...
Am I missing something here?
I must have missed the day he went over this, because it's a little hard for me to get what he's trying to say.
Maybe I'm looking at it too hard, but all the structures we've learned so far ( list, stack, queue, binary tree, etc ) all seem to have pretty straight-forward representations in code. The only data structure we have encountered that has a different C++ representation are child-sibling trees...
Am I missing something here?
