Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Question 1 1 pts In a singly linked list, each node has which of the following? You can choose more than one correct answer, if
Question 1 1 pts In a singly linked list, each node has which of the following? You can choose more than one correct answer, if appropriate. O a pointer to the head of the linked list a pointer to the tail of the linked list O a pointer to the previous node O a pointer to the next node Question 2 1 pts Consider the following structure of a node for a linked list. struct Node { int key; Node *next; }; What will be the output of the following pseudo-code? Assume, head is a pointer to the first node of the following linked list. 5->2->8->2->9->2->11-> NULL Node *pres = head; int count = @; while(pres!= NULL && count key == 2) { count = count + 1; pres = pres->next; } cout key key==1) if(head->next == NULL) if(head == NULL) if(head->key == 0) Question 4 1 pts Consider the following structure for a linked list: struct Node { int key; Node *next; class Linked List { private: Node *head; public: Linkedlist head = NULL; } void insert(Node *prev, int newkey); Node* searchList(int key); bool deleteAt Index(int index); void printList(); }; Assume we have already inserted one element into the linked list. Consider the following code segment: 1. Node* temp = new Node; 2. temp = head, 3. delete temp; Which of the following statements are true? This code will cause a memory leak This code inserts a new node at the beginning of a linked list Line 3 will delete the Node allocated in Line 1 There are no issues in this code Question 5 1 pts I am trying to delete the a node in the middle of a singly linked list. I currently have a pointer called pres, which points to the address of the node I want to delete and a pointer called prev, which points to the address of the node before the one I want to delete, as seen below: data next data next data next data next 3 10 2 1 NULL head prev pres What do I do to delete the node pointed to by pres? O delete pres; delete prev: O prev->next = pres->next; delete pres O pres->next = prev->next; delete prev: O prev->next = NULL; delete pres O prev->next = head; delete pres, O delete pres Question 6 1 pts
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started