No code writing needed, just need the answers for each part of this question. Please write in complete sentences with full explanations for each steps. a). Assign the keys, 59, 140, 30, 41,68, 115, 70, 155, 99, 92 to the nodes of the binary search tree shown below. Feel free to do trials and errors to fill the tree with the given list of keys. b). There are a list of random keys and a binary search tree. The tree shape is fixed like the example below and you can't change it. The number of keys in the list is the same as the number of available nodes of the tree. We want to systematically fill in all the nodes of the tree with the randomly ordered list of the keys. Describe an algorithm to fill the tree completely. c). Starting from the root node, we want to populate a BST with the keys from a given list without altering its order. Using the keys and the tree in question a) as an example, show the ordered list of the keys which can be sequentially inserted into the tree. Also, explain and demonstrate how you would get such a list systematically using the tree from question b). Please limit your description to a sentence or two.
No code writing needed, just need the answers for each part of this question. Please write in complete sentences with full explanations for each steps.
a). Assign the keys, 59, 140, 30, 41,68, 115, 70, 155, 99, 92 to the nodes of the binary search tree shown below. Feel free to do trials and errors to fill the tree with the given list of keys.
b). There are a list of random keys and a binary search tree. The tree shape is fixed like the example below and you can't change it. The number of keys in the list is the same as the number of available nodes of the tree. We want to systematically fill in all the nodes of the tree with the randomly ordered list of the keys. Describe an
c). Starting from the root node, we want to populate a BST with the keys from a given list without altering its order. Using the keys and the tree in question a) as an example, show the ordered list of the keys which can be sequentially inserted into the tree. Also, explain and demonstrate how you would get such a list systematically using the tree from question b). Please limit your description to a sentence or two.
d). Describe why this specific instance of binary search tree below can't be colored to form a valid red-black tree even without populating keys.
e). Now let's try to do two rotations to make it an RB tree. Describe how rotations are done and show the final picture of an RB tree showing each node with a key value and its color.
Please read carefully and follow the instructions written above for each part of this question.
Here is the BST below:
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
