(a) Draw the Binary Search Tree that results when the following keys are inserted in order: 38, 5, 45, 9, 8, 1, 47, 15,
Posted: Sun May 15, 2022 12:59 pm
(a) Draw the Binary Search Tree that results when the
following keys are inserted in order: 38, 5, 45, 9, 8, 1, 47, 15,
13, 46 (remember, there is no rebalancing for basic
BST).
(b) Write down the inorder traversal of this
tree.
(c) Write down the postorder traversal of this
tree.
(d) Suppose the value 9 is removed. Draw the resulting
tree.
following keys are inserted in order: 38, 5, 45, 9, 8, 1, 47, 15,
13, 46 (remember, there is no rebalancing for basic
BST).
(b) Write down the inorder traversal of this
tree.
(c) Write down the postorder traversal of this
tree.
(d) Suppose the value 9 is removed. Draw the resulting
tree.