. AT&T 2:39 PM 3. (a) Give traversals of the tree shown below Pre-Order: Post-Order: In-Order: 20 42 56 18 (b) The following items are inserted into a binary search tree: 3, 6, 5, 2, 4, 7, 1. Which is the deepest? Justify (c) Give the tightest possible upper bound for the worst case running time for each of the following in terms of N. Justify. (CI)) Dequeue from a queue containing N elements implemented as a circular array (as described in lecture) (c.2) Delete a node in a Binary Search Tree of sizeN (c3) Post-order traversal of a Binary Tree containing N elements