1. Use binary tree implementation to build the tree below. Then, show inorder, preorder, and
postorder traversal results in the output.
(2 marks)
1
2
3
4
7
6
5
2. Insert the following elements into a heap tree and display the heap contents in the output. Draw the
heap tree in the submission sheet.
15, 10, 18, 5, 2, 12, 9, 20, 6
(3 marks)