Implement the following linkedlist using C program. Sample Input : Generate the linkedlistwith Sam, Paul, Henry, Alan. Sort the linkedlist in ascendingorder as follows and yourstart pointer is Alan. Delete Henry from the abovelinkedlist and add Bill gates and your final linkedlistwillbewithnodesAlan, Bill Gates, Henry, Paul and Sam.

Implement the following linkedlist using C program. Sample Input : Generate the linkedlistwith Sam, Paul, Henry, Alan. Sort the linkedlist in ascendingorder as follows and yourstart pointer is Alan. Delete Henry from the abovelinkedlist and add Bill gates and your final linkedlistwillbewithnodesAlan, Bill Gates, Henry, Paul and Sam.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

1. Implement a function insertBook(Book newBook) to add a book at the end of thelinked list.a. Ask the librarian to input all the necessary book information.b. Use the information to create a Book objectc. Pass through the Book object as the parameter to the functiond. Store the Book object into the Node objecte. “Link” the object with the rest of the linked list2. Implement a function insertBefore(Book newBook, int bookID) to add a book infront of another book given its bookID.a. Ask the librarian to input all the necessary book information.b. Use the information to create a Book objectc. Pass through the Book object and bookID as the parameter to the functiond. Search for the matching Book objecte. Store the Book object into the Node objectf. “Link” the object with the rest of the linked list3. Implement a function searchBook(int bookID) to search for a book by its bookIDcode and return the book object.a. Ask the librarian to input the bookID.b. If the book doesn’t exist display an…
IMPLEMENT FUNCTIONS C++ #include "node.h"#include "list.h"#include <cstdlib>#include <iostream>using namespace std; class DoublyLinkedList : public List { node* head; node* tail; int index; node* create_node(int num, node* predecessor, node* successor) { node* n = (node*) malloc( sizeof(node) ); n->element = num; n->next = successor; n->prev = predecessor; return n; } void add_between(int num, node* predecessor, node* successor) { node* newest = create_node(num, predecessor, successor); predecessor->next = newest; successor->prev = newest; index++; } public: DoublyLinkedList() { index = 0; head = create_node(0, NULL, NULL); tail = create_node(0, head, NULL); head->next = tail; } ~DoublyLinkedList() { clear(); } void addHead(int num) { add_between(num, head,…
write a code in c++ and implement an Emergency Room Patients HealthcareManagement System (ERPHMS) that uses stacks, queues, linked lists, and binary search tree The system should be able to keep the patient’s records, visits, appointments, diagnostics,treatments, observations, Physicians records, etc.It should allow you to1. Add new patient2. Add new physician record to a patient3. Find patient by name4. Find patient by birth date5. Find the patients visit history6. Display all patients7. Print invoice that includes details of the visit and cost of each item done8. Exit PLEASE SHOW THE CODE
1. a function that takes in a list (L), and creates a copy of L. note: The function should return a pointer to the first element in the new L. [iteration and recursion]. 2. a function that takes in 2 sorted linked lists, and merges them into a single sorted list. note: This must be done in-place, and it must run in O(n+m).
Implement the function below void swap(int pos1, int pos2) {} Inital code to be completed: class LinkedList : public List { node* head; node* tail; int index; node* create_node(int num) { node* n = (node*) malloc(sizeof(node)); n->element = num; n->next = NULL; return n; } public: LinkedList() { index = 0; head = NULL; tail = NULL; } int add(int num) { addTail(num); return index; } int get(int pos) { node* currnode = head; int count =0; while (currnode != NULL){ count++; if (count == pos){ return currnode -> element; }else{ currnode = currnode -> next; } } return -1; } int size() { return index; } void swap(int pos1, int pos2) { } // WARNING!…
Implement in C Programming 8.18.1: LAB: Simple linked list Given an IntNode struct and the operating functions for a linked list, complete the following functions to extend the functionality of the linked list: IntNode* IntNode_GetNth(IntNode* firstNode, int n)- Return a pointer to the nth node of the list starting at firstNode. void IntNode_PrintList(IntNode* firstNode) - Call IntNode_PrintNodeData() to output values of the list starting at firstNode. Do not add extra space characters in between values. int IntNode_SumList(IntNode* firstNode) - Return the sum of the values of all nodes starting at firstNode. Note: The code for IntNode_Create() provided here differs from the code shown in the book. The given main() performs various actions to test IntNode_GetNth(), IntNode_PrintList(), and IntNode_SumList(). main() reads 5 integers from a user: The number of nodes to be added to a new list The value of the first node of the list An increment between the values of two consecutive…
Write a program in C to implement the linked list and perform insertion and deletion of a node from the linked list from the start, end, and intermediate positions of the list. The program should take care of the boundary cases. #include<stdio.h> #include<stdlib.h> typedef struct node { int data; struct node *link; }nod; nod *insertion_function(nod *head, int *n, int x, int posflag) { /*input: head node, x:element, pos: -1 indicates start, n last of the node*/ /*output: length of the list after insertion*/ nod *temp_node=(nod*)malloc(sizeof(nod)); nod *current=NULL; temp_node->data=x; if(head==NULL) { temp_node->link=NULL; head=temp_node; } if(posflag==-1) { temp_node->link=head; head=temp_node; } else if(posflag==*n) { temp_node->link=NULL; current=head; while(current->link!=NULL) current=current->link; current->link=temp_node; } *n=*n+1; return head; } void printfunc(nod *head) { nod *current=NULL; current=head; while(current!=NULL) {…
Write a C program to perform following operations on Single LinkedList:  Create() - Create a Single Linked list with 8 Nodes  Insert() - Insert a node in the ending  OddDisplay () - Display only those Nodes which has Odd Value and sum it  Count() - Count the length of the Linkedlist Note: It must be a menu-driven program and User defined functions must be there for all the functionalities.
Code Restructuring: Methods for Linked List operations are given. Restructure the codes to improve performance of codes. Linked List is a part of the Collection framework present in java.util package, however, to be able to check the complexity of Linked List operations, we can recode the data structure based on Java Documentation https://docs.oracle.com/javase/8/docs/api/java/util/LinkedList.html Instruction 1: Two (2) Java classes are provided, first, the Linked List class and second, the Linked List interface. On the Linked List class, check the comments, analyze then try to recode the said method/s. Post the changes in your code, if any. package com.linkedlist; public class LinkedList<E> implements ListI<E>{ //The Node Object signatures and constructor class Node<E>{ E data; Node<E> next; public Node(E obj) { data=obj; next=null; } }…
Complete the implementation of the class LinkedSortedList, and write a driver program to fully test it. (Ch. 12, Programming Problems 1, pg. 392 of Data Abstraction and Problem Solving with C++ (7th Edition) ) Name the program sortedlist.cpp. Make sure the following requirements are met. Program must compile and run. Must use the Sorted List ADT  SortedListInterface.h    For LinkSortedList pg. 376 has the code for insertSorted. You must complete the implementation. Image shown below: Therefore the LinkedSortedList is not based on a LinkedList but uses its own link-based implementation. Do not use throw on function declarations as it is obsolete. Driver program should: create a sorted list insert 21 random numbers (1-100) using the STL random library Display the numbers as they are inserted. Then remove the first number inserted. Last of all display the sorted list of 20 numbers. No user input for driver program. SortedListInterface.h: //Â Created by Frank M. Carrano and Timothy…
Please with explanation \\\\\\\\\\\\\\\\\\\ JAVA\\\\\\\\\\\\\\\\\\\\\\\\\\ //21.3 * 3.1 / ( 14 + (6+2.1)^3)    } //TODO   public void convertToPostFix() { //create a stack of operators.   //create Vector postFix     //Go through inFix from 0 to size-1     //if current element is operand add it to postFix       //if operator then as long as top of stack is operator of higher or equal   //precedence pop it from stack and add it to postFix   //push operator to stack       //if open parenthesis push it to stack       //if close parenthesis as long as top of stack is not open parenthesis, pop from   //stack and add it to postFix.   //pop the open parenthesis from stack (don't add it to postfix)     //empty stack into postFix.           } //TODO   public double evaluate() { double result;     return…
Implement the function below void swap(int pos1, int pos2) {} For LinkedList, to maintain integrity of data in the structure, you are not to swap directly the element, nor remove a node. Instead, you are to only change the nodes' next pointers. Inital code to be completed: class LinkedList : public List { node* head; node* tail; int index; node* create_node(int num) { node* n = (node*) malloc(sizeof(node)); n->element = num; n->next = NULL; return n; } public: LinkedList() { index = 0; head = NULL; tail = NULL; } int add(int num) { addTail(num); return index; }     int get(int pos) { node* currnode = head; int count =0; while (currnode != NULL){ count++; if (count == pos){ return currnode -> element; }else{ currnode = currnode -> next; } }…