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

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

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
Expert Solution
steps

Step by step

Solved in 4 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY