Question

Write pseudocode for a recursive algorithm for inserting a key into a binary search tree. The following is the definition assumed.

right? Write a) pto) You hadt written codes for for a algonithm for inserting a key into a binary seareh tree. The public class BST E extends comparable V prot fected bstNodeE protected class bstNode E V E key V value; ,V> right); bstNode E vright bstNode (E key ngvalue , bstNode«E·V> left . bstNode«E publle void insert (E key . V value root-insert root, key, value) : following recursive function: where, you are being asked to complete the bstNode E, V> insert(bstNode E.v> T, E key. V value) root naert Croot es Ansver: 2. (b). You know that your code above with the BST is the recurrence T(n)-? U zethod, AND the substitution method to solve your recurrence. Find und g(n) for T (n) yo pts) Recursion-tree Method: u can for which T (n)O(g(n)). Explain your answer wer.

Answer 1

void insert(int data) {
   struct node *tempNode = (struct node*) malloc(sizeof(struct node));
   struct node *current;
   struct node *parent;

   tempNode->data = data;
   tempNode->leftChild = NULL;
   tempNode->rightChild = NULL;

   //if tree is empty
   if(root == NULL) {
      root = tempNode;
   } else {
      current = root;
      parent = NULL;

      while(1) {                
         parent = current;
                        
         //go to left of the tree
         if(data < parent->data) {
            current = current->leftChild;                
            //insert to the left
                                
            if(current == NULL) {
               parent->leftChild = tempNode;
               return;
            }
         }  //go to right of the tree
         else {
            current = current->rightChild;
            
            //insert to the right
            if(current == NULL) {
               parent->rightChild = tempNode;
               return;
            }
         }
      }            
   }
}