CS2303 Tutorial Week 7 Exercises:
1. Create a binary search tree according to the input sequence: 3, 5, 0, 2, 7, 6, 8, 9, 4, 1. Delete 3 from the tree.
What’s the running time for the function “countleaf” introduced in the lecture?
3. Reconstruct the binary tree whose postorder and inorder are as follows,
Postorder: BDFECA
Inorder: BACDFE