I have some questions about certain placement of child nodes since I'm just learning BSTs and it's quite confusing even after reading some sources and doing some online insertion applets. Let's say I want to add nodes 5,7,3,4 to an empty basic BST.
Ok I understand that the left child must be less than the parent AND less than or equal to the right child from that same parent. I follow it until we add the 4 node. How do we determine that the insertion of 4 goes to the bottom right leaf position of 3 instead of the bottom left leaf position? Also, doing a AVL insertion of nodes 5,18,3,7,11 yielded some surprising position placements. Inserting the fourth node, 7, went down through 18 instead of 3. Is there a particular reason why? Assuming that is the correct way, inserting 11 would switch the 11 and 18 spots, but wouldn't having 18 as the parent node, 7 as left child, and 11 as right child adhere to the principle of left child smaller than parent and smaller or equal to right child? I'm confused! I would appreciate any help. Thank you!
By traversing the binary tree and comparing the value at each node with 4...and in C there is a thing called recursion which you can use for traversing the tree from the top down.
Yes because that is the way b-tree works. The value 7 is first compared to the root node ie 5 and since 7 > 5 the right hand side of the tree is chosen. Thereafter 7 is compared to the right child ie 18 and since 7 < 18 its gets installed in the empty slot for the left child and so on and so forth...
No it would not since in b-tree only new nodes are installed but the occupied nodes are not replaced...
