Question

2. Do the following problems: Create a binary search tree (BST), with the following words inserted: Int, Char, Return, Break, Float, While, Short, Sort, Double, For, Continue. a. b. Insert the following words into the BST built in (a): Tree, Table, Binary, Network, Visit, Seekk, Traversal c. Where is the minimum key value in a BST? (Give a concrete example) d. Where is the maximum key value in a BST? (Give a concrete example) e. How many comparisons are needed to search for the key item Table in BST built in (b)? f. How many comparisons are needed to search for the key item Program in the BST built in (b)? g. Draw the shape of a BST with 15 nodes that requires the least possible number of comparisons

help

Answer 1

Solution:

First four subparts have been solved as HOMEWORKLIB guidelines, please repost others.

c)

The minimum key in a BST is always present on the leftmost leaf node, like in the above example in the b part Binary is the smallest of them all.

The minimum value can also be the left sutree node of the root which has only right subtree and no children on the left hand side.

d)

In the above example While is the maximum key value.

The maximum key value will be of the node which is present in the right-hand side of the root, and it is either the rightmost leaf node or it is the node which has only left subtree in it.

I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)