: Binary Search Trees a) Create a binary search tree for the following numbers. The numbers are read in sequence from left to right. 17,52,38,16,14,18,8,16,19,25 b) Please answer the following for the tree constructed in Part a): - Is it a balanced tree? Why? - Is it a complete tree? Why? - Is it a full tree? Why? - What is the path from root to node containing value 19? - What is the level of node containing value 19? - What are the siblings of node containing value 14 ? - What are the descendants of node containing value 38 ? - Who are the ancestors of node containing value 8 ? - What is the height of the tree? c) In what sequence would the nodes be traversed for the tree constructed in Part a) using: - Pre-order traversal - In-order traversal - Post-order traversal d) Please draw the binary search tree after we remove root node containing value 17