Question
Given the Binary Search Tree below: Answer the following questions (1 point each): a. What is the depth of the node holding key 40? b.
Given the Binary Search Tree below:
Answer the following questions (1 point each):
a. What is the depth of the node holding key 40?
b. What is the height of the tree?
c. List the nodes in the order of visit of an inorder traversal starting from the root node.
d. Draw the tree after a new node with key 22 is inserted.
e. Draw the original tree after the node with key 25 is deleted. (Do not consider the previous insertions or deletions.)
f. Draw the original tree after the node with key 35 is deleted. (Do not consider the previous insertions or deletions.)
35 20 60 10 25 50 65 15 30 40 45
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started