c:

Q3 (a) (10 points): For the input items below, construct (draw) a binary search tree by reading the items sequentially so that when the tree is traversed in inorder the items in the list are printed in ascending (increasing) order. 7 5 6 11 9 4 1 19 10 3 03 (b) (15 points): Give the inorder and postorder traverses of the following tree: K Your answer: Inorder traverse: B C D A G Postorder traverse: E I L H L Page 4 of 5 Q3 (c) (10 points). Consider the following arithmetic expression: K+(L-5)$7$2*3/L Draw a binary tree that represents the expression