Thumbs up for correct answer.

Given the Binary Search Tree below: 35 20 10 25 50 15 30 40 45 Answer the following questions (1 point each): a What is the height of node holding key value 40 the height of the tree? List the nodes in the order of visit of a Preorder traversal starting from the root node (do not list the empty external nodes). c. ust the nodes in the order of visit of a Postorder traversal starting from the root node (do not list the empty external nodes). d. L e. Is this tree an AVL tree? If not, list the nodes where the AVL height balance property is not satisfied. f Draw the tree after a new node with key "22" is inserted. Treat the tree as a regular (potentially unbalanced) tree. g. Draw the original tree after the node with key "35" is deleted. Do not consider the insertion of key "22". Treat the tree as a regular (potentially unbalanced) tree