Question

From the code below with Binary Search Tree recurrence T(n)=? use the recursion method and substitution method to solve the recurrence. Find the tightest bound g(n) for T(n) you can for which T(n)= O(g(n)). Explain your answer and use recursion tree method.

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;
            }
         }
      }            
   }
}

2(a)(s pt) Yu had written eodes for BST Ror Programming Assignments,right? Write public class BSTKE exten Comparable E-V protected bstNodeEVroot proteeted class bstNodecE E key V value: bstNodeKE Vs left bstNode E.v> right bstNode (E key V value bstNodeE Vleft bstNodecE >right public void insert (E key V value) { root = insert ( root, key, value ) ; where, you are being asked to complete the following recursive function: bstNode E,V insert(bstNode E,V T, E key, V value)

Answer 1

Re uthod