Q2.1 Insert 3 Points 6 10 10 4 8 12 14 Consider adding the following three...

Transcribed Image Text:

Q2.1 Insert 3 Points 6 10 10 4 8 12 14 Consider adding the following three values one at a time in this order to the tree, maintaining the property that it is a binary search tree: 9, then 7, then 5. Describe where the three values would be added to the tree. Be sure to specify for each whether it is a left or right child of which other value/node. For example, you could say (though it would not be correct) that 9 would be added as the right child of 14. You do not need to explain your answer. Enter your answer here Q2.1 Insert 3 Points 6 10 10 4 8 12 14 Consider adding the following three values one at a time in this order to the tree, maintaining the property that it is a binary search tree: 9, then 7, then 5. Describe where the three values would be added to the tree. Be sure to specify for each whether it is a left or right child of which other value/node. For example, you could say (though it would not be correct) that 9 would be added as the right child of 14. You do not need to explain your answer. Enter your answer here