You are viewing a single comment's thread. Return to all comments →
This is a in-order traversal. Left-root-Right. So, for 32 nodes, 16th node is the root. 1st node would be leftmost leaf child.
Seems like cookies are disabled on this browser, please enable them to open this website
Trees: Is This a Binary Search Tree?
You are viewing a single comment's thread. Return to all comments →
This is a in-order traversal. Left-root-Right. So, for 32 nodes, 16th node is the root. 1st node would be leftmost leaf child.