Draw the tree resulting from inserting the following values into a binary search tree in order witho

Draw the tree resulting from inserting the following values into a binary search tree in order without re-balancing:
4, 1, 6, 3, 2, 9, 7, 5
Null pointers can be omitted as long as it is clear whether a single child is a left or right child. THEN For every node in the tree, the values that can be in the subtree rooted at that node are constrained by ancestors to be in some range of integers. The root (the node with 4 in it) has the trivial constraint (-∞,∞). Give the constraints on all other nodes.

 

Looking for a Similar Assignment? Let us take care of your classwork while you enjoy your free time! All papers are written from scratch and are 100% Original. Try us today! Use Code FREE15