help

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