Consider the following binary search tree (BST) and answer the following questions. (ii) (iii) (iv) (v) (vi) 4 6 8 9 List the nodes visited in in-order traversal List the nodes visited in pre-order traversal List the nodes visited in post-order traversal Give the height of the tree Explain how the node should be replaced if the node 4 is deleted Explain how the node should be replaced if the node 5 is deleted