QUESTION
(a) Construct a binary tree for the following numbers assuming that a number greater than the node (starting from the root) goes to the left else it goes to the right.
15, 23, 7, 27, 11, 3, 28, 9, 13, 14, 12, 8, 10, 25, 24, 26, 30, 29, 1, 5, 6, 2, 0, 4, 19,
17, 16, 20, 18, 21, 22.
(b) Perform inorder, postorder and preorder traversals with the tree constructed in part (b).