3 Which XXX completes the following algorithm for inserting a new node into a singly-linked list? (Thisalgorithm will insert newNode after curNode )void List::InsertAfter(Node* curNode, Node* newNode) {if (headheadtailnullptr) {newNode=== newNode}else if (curNodetail »nexttailtail) {=== newNode= newNodeelse {// XXX}}newNodenext = curNode»nextcurNodenewNode%DcurNode nextnewNodenext =curNode next = nullnewNode-»next = nullcurNode»next= list tail-nextcurNode»nextnewNodenext = curNode»nextnewNodenewNode»nextcurNode nextcurNode next = newNode

Which XXX completes the following algorithm for inserting a new node into a singly-linked list? (This algorithm will insert newNode after curNode ) void List::InsertAfter(Node* curNode, Node* newNode) { if (head == nullptr) { head = newNode tail = newNode } else if (curNode == tail-next = newNode tail = newNode tail) { else { // XXX } } newNode-next = curNode-»next curNode = newNode newNode»next = curNode-next curNode--next = null newNode-next = null curNode-»next = list-»tail-next curNode--next = newNode newNode-next = curNode»next newNode-»next = curNode-»next curNode»next = newNode

Which XXX completes the following algorithm for inserting a new node into a singly-linked list? (This algorithm will insert newNode after curNode ) void List::InsertAfter(Node* curNode, Node* newNode) { if (head == nullptr) { head = newNode tail = newNode } else if (curNode == tail-next = newNode tail = newNode tail) { else { // XXX } } newNode-next = curNode-»next curNode = newNode newNode»next = curNode-next curNode--next = null newNode-next = null curNode-»next = list-»tail-next curNode--next = newNode newNode-next = curNode»next newNode-»next = curNode-»next curNode»next = newNode

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 3SA

See similar textbooks

Similar questions

Which XXX completes the following algorithm for inserting a new node into a singly-linked list? ListInsertAfter(list, curNode, newNode) {if (list⇢head == null) {list⇢head = newNodelist⇢tail = newNode}else if (curNode == list⇢tail) {list⇢tail⇢next = newNodelist⇢tail = newNode}else {XXX}} Group of answer choices newNode⇢next = curNode⇢nextcurNode⇢next = null newNode⇢next = nullcurNode⇢next = list⇢tail⇢next newNode⇢next = curNode⇢nextcurNode⇢next = newNode newNode⇢next = curNode⇢nextcurNode = newNode
Which code part (A, B, C, or D) is incorrect? Add element in Linked List at particular index: add(int index, T item) void add(int index, int value) { // A. ============================================= if(index < 0 || index > count){ cerr << "Index Out of Bounds"; return; } node *temp = new node; temp->item = value; // A. ============================================= // B. ============================================= if (index == 0) { temp->next = head; head = temp; } // B. ============================================= // C. ============================================= else { node *previous = head; for(int i = 0; i < index - 1; ++i){ previous = previous->next; } // C. ============================================= // D. ============================================= previous->next = temp; temp->next = previous->next; } // D. ============================================= ++count; return; }
Change the insert and _insert methods accordingly to comply with the new format. - If a new word is inserted that has a matching sorted order of its letters as an existing Node, do not insert a new Node. Instead, modify the existing Node and append the inserted word into the list. Starter Code class Node: def __init__(self, value): self.value = value self.left = None self.right = None def __str__(self): return ("Node({})".format(self.value)) __repr__ = __str__ class BinarySearchTree: ''' >>> x=BinarySearchTree() >>> x.insert('mom') >>> x.insert('omm') >>> x.insert('mmo') >>> x.root Node({'mmo': ['mom', 'omm', 'mmo']}) >>> x.insert('sat') >>> x.insert('kind') >>> x.insert('ats') >>> x.root.left Node({'ast': ['sat', 'ats']}) >>> x.root.right is None…
You have two numbers represented by a linked list, where each node contains a singledigit. The digits are stored in reverse order, such that the 1 's digit is at the head of the list. Write afunction that adds the two numbers and returns the sum as a linked list.EXAMPLEInput: (7-> 1 -> 6) + (5 -> 9 -> 2).That is,617 + 295.Output: 2 -> 1 -> 9. That is, 912.FOLLOW UPSuppose the digits are stored in forward order. Repeat the above problem.Input: (6 -> 1 -> 7) + (2 -> 9 -> 5).That is,617 + 295.Output: 9 -> 1 -> 2. That is, 912
You have two numbers represented by a linked list, where each node contains a singledigit. The digits are stored in reverse order, such that the 1 's digit is at the head of the list. Write afunction that adds the two numbers and returns the sum as a linked list.EXAMPLEInput: (7-> 1 -> 6) + (5 -> 9 -> 2).That is,617 + 295.Output: 2 -> 1 -> 9. That is, 912.FOLLOW UPSuppose the digits are stored in forward order. Repeat the above problem.EXAMPLElnput:(6 -> 1 -> 7) + (2 -> 9 -> 5).That is,617 + 295.Output: 9 -> 1 -> 2. That is, 912
q6) Which of the following linked list can move only in one direction to access the data of the node? a. Single linked list b. Circular Double linked list c. None d. Double linked list
In a doubly linked list of five nodes, if n points at the first node and p points at the second node, which of the following expressions does not refer to the third node in the list? a. p.next b. n.next.next.prev.next c. p.prev.next d. p.next.prev.next e. n.next.next
implement this method: numOccurrencesRec(LNode node, int n, int key) – This method takes as parameters a reference to the head of a linked list, a position specified by n, and a key. It returns the number of occurrences of the key in the linked list beginning at the n-th node. If n = 0, it means you should search in the entire linked list. If n = 1, then you should skip the first node in the list.
Which of the following tree traversals require the use of a queue? (can be multiple) A. Inorder traversal B. Preorder Traversal C. Breadth first search D. Postorder traversal
For a Doubly Linked List implement the following method: void deleteAfterHead() //Delete the second node from the list. If the list has only one element, delete the head. Assume you have deleteFromHead() and deleteFromTail() methods.
Write down the insertBefore method which inserts a new element in the list before the node containing the given element.The method takes as parameters a dummy headed doubly linked circular list, the element existing in the list and new element to be added. public void insertBefore (Node head, Object elem, ObjectnewElement){//to do} insertBefore (head, 3, 50).
Q.4 What does the following function do for a given Linked List? (2)void fun1(struct node* head){if(head == NULL)return;fun1(head->next);printf("%d ", head->data);}