I want to convert this method to search by first letter instead of the full name (for example if the user enter F it shows all node that have F letter in its name )   public void search() {   int flag = 0;   Node pointer;   System.out.print("Enter the name you want to search: ");   String key = input.next();   pointer = root;      while (pointer != null)      {   if (pointer.name.compareTo(key) == 0) {   flag = 1;   System.out.println("RECORD FOUND");   System.out.println();   System.out.println("--------------------------");   System.out.println("NAME\t| CONTACT NUMBER ");   System.out.println("--------------------------");   System.out.println("" + pointer.name + "\t " + pointer.number);   System.out.println("------------------------");   break;   }   if ((pointer.name).compareTo(key) > 0) {   pointer = pointer.left;   } else {   pointer = pointer.right;   }   }   if (flag == 0) {   System.out.println("RECORD NOT FOUND");   }   }

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

 

I want to convert this method to search by first letter instead of the full name (for example if the user enter F it shows all node that have F letter in its name )

 

public void search() {

 

int flag = 0;

 

Node pointer;

 

System.out.print("Enter the name you want to search: ");

 

String key = input.next();

 

pointer = root;

 

   while (pointer != null)

 

   {

 

if (pointer.name.compareTo(key) == 0) {

 

flag = 1;

 

System.out.println("RECORD FOUND");

 

System.out.println();

 

System.out.println("--------------------------");

 

System.out.println("NAME\t| CONTACT NUMBER ");

 

System.out.println("--------------------------");

 

System.out.println("" + pointer.name + "\t " + pointer.number);

 

System.out.println("------------------------");

 

break;

 

}

 

if ((pointer.name).compareTo(key) > 0) {

 

pointer = pointer.left;

 

} else {

 

pointer = pointer.right;

 

}

 

}

 

if (flag == 0) {

 

System.out.println("RECORD NOT FOUND");

 

}

 

}

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Operations of Linked List
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-engineering and related others by exploring similar questions and additional content below.
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