1. (12 pts) Consider the following binary search tree, a) Which node has the 3r smallest value? (A,B,C.... are just labels of nodes) b) Which node has the 3rd largest value? (A, B, C, ... are just labels of nodes) c) List the sequence of visiting nodes using a preorder traversal method. d) List the sequence of visiting nodes using an inorder traversal method. e) List the sequence of visiting nodes using a postorder traversal method. f) List the sequence of nodes in ascending order