What's the difference between a parent and predecessor node in binary search tree?
Expand Post »
Just wondering what the difference is. I don't think I need to post my code, but basically for my assignment, I have stubs for a binary search tree. There are nodes created in the constructor, and among them are:
Node parent
Node predecessor
Node sucessor
Node right
Node left
Is there a point in predecessor and sucessor? Seems to me it would work with just parent, right, and left, no?
No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.
Offline 
Unsolved 
