Define the structure of a binary tree. Explain the algorithm for inserting a number onto a binary tree such that the numbers on the tree can be traversed in a sorted manner. You do not need to explain the process of traversal. Draw the binary tree created by the algorithm when it inserts these numbers one by one from left to right: 9, –16, 8, 12, 32, 21, 4, -6, 8, 14, –2, –20, 40

C++  Sketch a left rotation on an AVL.  build the following AVL tree: insert 5insert 2insert 7insert 9insert 11  follow the insert algorithm draw out the original tree prior to any rotations-which node breaks the avl condition-label N, R, A, B, C, and the parent of N.-draw out the final tree after any rotation

The elements in a binary tree are to be stored in an array, as described in this sec- tion. Each element is a nonnegative int value. a. Which value can you use as the dummy value, if the binary tree is not complete? b. Draw the array that would represent the following tree: 14 7 26 33 35 38 44 50 60

Construct a binary search tree from the list of the following keys using inserts: 18 2 9 6 7 4 3 20 16 17 8 12 5 4 The key 18 is the first one that will be inserted into the tree.Draw the final tree and 3 other trees to show the intermediate steps.Do an inorder traversal of the tree. What's the list you get?