Question: 1. Show the binary search tree that results from the insertion of the following numbers into an initially empty tree (be sure to show your
1. Show the binary search tree that results from the insertion of the following numbers into an initially empty tree (be sure to show your work): 1 - 2 - 3 - 4 - 5 - 6 - 7
2. Show the splay tree that results from the insertion of the following numbers into an initially empty tree (be sure to show your work): 1 - 2 - 3 - 4 - 5 - 6 - 7
3. Show the splay tree that results from a search(1) operation on the splay tree from question 2. Be sure to show your work.
4. Based upon the resultant trees from questions 15 - 17, what conclusions can you draw regarding the self-adjusting nature of a splay tree versus a binary search tree?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
