HW02

1. Given an insertion of numbers [70, 32, 55, 5, 30, 2, 85, 83,

42, 22] into a binary search tree, draw the tree and
provide its pre-order traversal, in-order traversal, and
post-order traversal.
Ans:
70
85

32

58
55
83

05
42
02

30

22

Pre-Order: 70, 32, 5, 2, 30, 22, 55, 42, 85, 83

In-Order: 2, 5, 22, 30, 32, 42, 55, 70, 83, 85
Post-Order: 2, 22, 30, 5, 42, 55, 32, 83, 85,70
2. Given the following traversals for a binary search tree,
draw the tree.
Pre-order: F, B, A, D, C, E, K, H, G, I, J, L, M

In-order: A, B, C, D, E, F, G, H, I, J, K, L, M