Answer and explain this question from Algorithm Design and Analysis class. Thank

Question

Answer and explain this question from Algorithm Design and Analysis class. Thanks

Question 1: Consider a Stac . Using Push (item), Pop0, and Top O functions, call the sequence of functions to remove the third from the top item of the stack. All the remaining items should remain in the stack after this (see an example below). Note that Top O returns the top item from the stack while Pop0 removes the top item from the stack. Here is an example. k of n integers where n >2 Current Stack After deleting the third from the top item 12 14 10 23 17 12 14 23 17 Question 2:Consider a singly linked list. Write a function to find the size (the number of nodes) of the linked list.

Explanation / Answer

1) See the Explanation and Answer below

ITEM1 = Top() ; // Keeps 12 In ITEM1
POP();    //Removes The 1st Element from The Stack
ITEM2 = Top() ; // Keeps 14 In ITEM2
POP();   //Removes The 2nd Element from The Stack
POP(); //Removes The 3rd Element from The Stack

PUSH(ITEM2); //Pushes 14 in Stack
PUSH(ITEM1); //Pushes 12 in Stack


2) See the Explanation and Answer below

Lets Assume Linked List is of Type :

struct Node {

int value;

struct Node* next;

};

int Length(struct Node *node)

{

int count = 0;

while (node != NULL)

{

count++;

node = node->next;

}

return count;

}

============
Thanks, let me know if there is any concern. PLEASE RATE

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.