a. Write a function named sorted_insert that takes a parameter and inserts it into a singly linked list in ascending order. For example, if the list contains the following items: HEAD Python class Node: def def 3 10 NULL/None then, after calling sorted_insert (5), it will be as follows: HEAD 3 5 10 More specifically, complete the sorted_insert function in the following code. (If you are not comfortable with Classes and Objects, you can write a normal function and consider the Head pointer/reference as a global variable.) _init (self, d): self.data d self.next None class LinkedList: _init__(self): self. Head None #include sll LinkedList () sll.sorted_insert (3) s11.sorted_insert (6) sll.sorted_insert (10) sll.sorted_insert (7) sll.sorted insert (5) sll.display() class Node( public: int data: Node next; Node (int d) { data d next = NULL; ) }; def sorted_insert (self, class LinkedList( #write your code hepublic: Node void sorted_insert(int v) ( // write your code here } }; int main() Head = NULL; LinkedList 11; 11.sorted_insert (3); 11.sorted insert (6) 11.sorted insert (10) 11.sorted insert (); 11.sorted insert (5); return 0; Weit NULL/None b. Write a function named median which calculates and returns the median of the values in the above sorted linked list.
a. Write a function named sorted_insert that takes a parameter and inserts it into a singly linked list in ascending order. For example, if the list contains the following items: HEAD Python class Node: def def 3 10 NULL/None then, after calling sorted_insert (5), it will be as follows: HEAD 3 5 10 More specifically, complete the sorted_insert function in the following code. (If you are not comfortable with Classes and Objects, you can write a normal function and consider the Head pointer/reference as a global variable.) _init (self, d): self.data d self.next None class LinkedList: _init__(self): self. Head None #include sll LinkedList () sll.sorted_insert (3) s11.sorted_insert (6) sll.sorted_insert (10) sll.sorted_insert (7) sll.sorted insert (5) sll.display() class Node( public: int data: Node next; Node (int d) { data d next = NULL; ) }; def sorted_insert (self, class LinkedList( #write your code hepublic: Node void sorted_insert(int v) ( // write your code here } }; int main() Head = NULL; LinkedList 11; 11.sorted_insert (3); 11.sorted insert (6) 11.sorted insert (10) 11.sorted insert (); 11.sorted insert (5); return 0; Weit NULL/None b. Write a function named median which calculates and returns the median of the values in the above sorted linked list.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
please use python language
Transcribed Image Text:a. Write a function named sorted_insert that takes a parameter and inserts it into a singly
linked list in ascending order. For example, if the list contains the following items:
HEAD
Python
class Node:
def
3
10
NULL/None
then, after calling sorted_insert (5), it will be as follows:
HEAD
3
10
NULL/None
More specifically, complete the sorted_insert function in the following code. (If you are
not comfortable with Classes and Objects, you can write a normal function and consider the
Head pointer/reference as a global variable.)
C++
#include <iostream>
_init__(self, d):
self.data d
self.next None
class LinkedList:
def _init (self):
self. Head None
5
s11 LinkedList ()
sll.sorted_insert (3)
s11.sorted insert (6)
sll.sorted_insert (10)
sll.sorted_insert (7)
sll.sorted insert (5)
sll.display()
class Node (
public:
int data/
Node *next/
Node (int d) {
data d
}
next = NULL:
def sorted_insert (self, class LinkedList(
Node Head NULL:
#write your code hepublic:
void sorted_insert (int v) (
// write your code here
)
}}
int main() (
LinkedList 11;
11.sorted_insert (3);
11.sorted_insert (6);
11.sorted insert (10);
11.sorted insert (7):
11.sorted insert (5);
return 0;
b. Write a function named median which calculates and returns the median of the values in the
above sorted linked list.
----Write your answer here ----
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education