Binary Search Tree Algorithm Visualization DAT 305

Top of Form

Part 1

Upon adding the numbers (20, 12, 23, 11, 21, 30) into the binary search tree, the results were the same as it was on zyBooks.

Questions:

1. As 18 is smaller than 20, it will go to 12, as 18 is greater than 12 it will be inserted to12's right child.
2. As 11 is smaller than 20, it will got to 12, as 11 is smaller than 12 it will go to 11, as it is equal to 11 therefore go to11's right child.
3. For a full 7 node BST3loop iteration will occur. As there are 3 levels.
4. For a full 255 node BST8loop iteration will occur. As there are 8 levels.floor(log2(255)) 1,formula to find the number of levels of a full BST.

Questions:

1. As key is 7 and cur is 29, key is...