Answer the following questions based on the BST:

1. Is your BST a full binary tree? If it is not, identify ONE node in this tree that violated the requirement for full binary tree. (1 point)

2. Is your BST a complete binary tree. If it is not, identify ONE node in this tree that violated the requirement for complete binary tree. (1 point)

3. Based on the current nature of the BST you constructed, present it in the most appropriate array structure (Consider the two array representations we discussed, use the one that you think is the most appropriate for the tree you constructed, assuming the shape of the tree wont change any longer) (1 point)

4. Show the InOrder, PreOrder, and PostOrder traversal of the tree (1 point for each traversal, no partial credit will be given)

5. Remove the 2 then the ROOT from the BST you constructed and show the result after each removal (1 point for each removal)

(o 2. 0