Question: Binary search tree help 1 of 4 #1(7 points] Given the Binary Search Tree below: 35 20 25 50 65 15 45 Answer the following
1 of 4 #1(7 points] Given the Binary Search Tree below: 35 20 25 50 65 15 45 Answer the following questions (1 point each): a. What is the height of node holding key value 40? b. What is the height of the tree? C. List the nodes in the order of visit of a Preorder traversal starting from the root node (do not list the empty external nodes). d.List the nodes in the order of visit of a Postorder traversal starting from the root node (do not list the empty external nodes). 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. 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
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
