Answer to Question #247708 in C++ for Roe

Question

NOTE: No code is required

Consider a BST which is constructed by the following node values(in the given order):

23,15,37,9,20,30,33.

Draw the BST and answer the following questions:

1)Draw BST for above data.

2)How many nodes are requiredto make a full tree?

3)What is the maximum level number of the tree?

4)What nodes are on Level 3?

5)Which nodes(s) has sibling?

Answer 1

The answer to your question is provided in the image: