. Assume you have a binary search tree with a root at 50, which of the following could not represent a valid search through the tree for a value? 2.Assume you have 8 different elements and wish to build a tree out of them. What are the largest and smallest heights this tree can have? 3.Assume you have a binary search tree where every pointer to another node requires 8 bytes and every value is a 4 byte integer. What is the total amount of space required if you have a tree with 3 levels and all levels are full?
. Assume you have a binary search tree with a root at 50, which of the following could not represent a valid search through the tree for a value?
2.Assume you have 8 different elements and wish to build a tree out of them. What are the largest and smallest heights this tree can have? 3.Assume you have a binary search tree where every pointer to another node requires 8 bytes and every value is a 4 byte integer. What is the total amount of space required if you have a tree with 3 levels and all levels are full?
4. Assume we are comparing a binary search tree and a normal tree's performance. Which of the following are a limitation of the BST in comparison with a normal tree?
5. Assume you have the first 5 outputs from a traversal of a binary search tree, 50, 45, 35, 25, 15. Which of the following could be the traversal represent?
6. Assume you have a complete binary search tree with a total size of 8 elements, what is the largest number of nodes that may have to be visited in a search operation?
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
