plz do not copy from chegg Problem 1. Implement a sorted singly linked list and support the following operations: bool SortedIsEmpty(): return true if the list is empty; int SortedGetLength(): return the length of the list; bool SortedFind(int k, int& x): return the value of the kth element; int SortedSearch(int key): return the position of the element which is same as key (note: use the most efficient method); void SortedInsert(int x): insert x to the right position in the sorted linked list; void SortedDelete(int k, int& x, bool& success): delete the kth element. Part (1) Implement the aboved singly linked list allowing the duplicate element. Part (2) Implement the above singly linked list without allowing the duplicate element. Test your program for both parts with the following operations: Insert 5 Insert 7 Insert 9 Insert 11 Insert 5 Print out the list Insert 7 Print out the list Find the 3rd element Search 7 Print out the length of the list Delete 7 Print out the list Search 7

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

plz do not copy from chegg

Problem 1. Implement a sorted singly linked list and support the following operations:

bool SortedIsEmpty(): return true if the list is empty;

int SortedGetLength(): return the length of the list;

bool SortedFind(int k, int& x): return the value of the kth element;

int SortedSearch(int key): return the position of the element which is same as key (note: use the most efficient method);

void SortedInsert(int x): insert x to the right position in the sorted linked list;

void SortedDelete(int k, int& x, bool& success): delete the kth element.

Part (1) Implement the aboved singly linked list allowing the duplicate element.

Part (2) Implement the above singly linked list without allowing the duplicate element.

Test your program for both parts with the following operations:

  1. Insert 5
  2. Insert 7
  3. Insert 9
  4. Insert 11
  5. Insert 5
  6. Print out the list
  7. Insert 7
  8. Print out the list
  9. Find the 3rd element
  10. Search 7
  11. Print out the length of the list
  12. Delete 7
  13. Print out the list
  14. Search 7

 

 

 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 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

Expert Answers to Latest Homework Questions