BST Python

1. For the following binary tree 2 A. (2 pts) Is the tree full? B. (2 pts) Is the tree complete? C. (2 pts) What is the tree's height? D. List the nodes in the tree in the order they would be visited during a a. (4 pts) Pre-order traversal b. (4 pts) Level-order traversal C. (4 pts) Post-order traversal d. (4 pts) In-order traversal 2. (2 pts) What is the time complexity to search a full BST? 3. The following questions refer to the same BST. The operations are cumulative A. (2 pts) Show the BST that would result from inserting the items 35, 20, 30, 50, 45, 60, 18, 25 in this sequence B. (2 pts) Show the BST that would result after removing item 35 (promote in order successor) C. (2 pts) Show the BST that would result after removing item 18 (promote in order successor) D. (2 pts) How would the trees in the previous problems look differently if we promote in order predecessors instead of successors