A co-worker emails you and said she developed a recursive version for doing search in a binary search tree. Here’s the code for the function: public boolean searchRecursive(Node current, int searchValue) {       if (current == null)             return false;       if (current.data == searchValue)             return true;       else if (current.data > searchValue)             return searchRecursive(current.right, searchValue);       else             return searchRecursive(current.left, searchValue);          }   She’s not sure if there is an error or not because the code does compile. You analyze the code and respond to her as follows:   Draw a picture of what a binary search tree would look like after inserting values of 10, 15, 18, 13, 5, 1, and 8 in that order Next, if you believe there is no error with the code, then show her how the code executes when searching for different values using the tree you made in step 1) Or, if you believe there is an error with the code, then show her how the code executes when searching for different values using the tree you made in step 1). In addition, show her the code fix(es) that should be made to get it to work

Help on the following question

A co-worker emails you and said she developed a recursive version for doing search in a binary search tree. Here’s the code for the function:

public boolean searchRecursive(Node current, int searchValue)

{

      if (current == null)

            return false;

if (current.data == searchValue)

            return true;

      else if (current.data > searchValue)

            return searchRecursive(current.right, searchValue);

      else

            return searchRecursive(current.left, searchValue);         

}

She’s not sure if there is an error or not because the code does compile. You analyze the code and respond to her as follows:

• Draw a picture of what a binary search tree would look like after inserting values of 10, 15, 18, 13, 5, 1, and 8 in that order
• Next, if you believe there is no error with the code, then show her how the code executes when searching for different values using the tree you made in step 1)
• Or, if you believe there is an error with the code, then show her how the code executes when searching for different values using the tree you made in step 1). In addition, show her the code fix(es) that should be made to get it to work