Question 1 1pts The node that is easiest to access in a linked-chain s the head

Question

Question 1 1pts The node that is easiest to access in a linked-chain s the head node the tail node O access time is the same for all nodes O it cannot be determined Question 2 1 pts In the Ch 6 linloed-chain implementation of a Stack ADT, the performance of popping an entry from the stack is 0(1) 02) Question 1 pts In the Ch 6 linked-chain implementation of a Stack ADT, when a node is popped from the stack O the original first node will no longer be referenced O the original first node will be dealocated the new first node will reference what was the second node in the chain O all af the above

Explanation / Answer

Answers:

Question1) the head node

Question2) O(1)

Explanation: in order to pop or push entry from the stack will take O(1) time

Question4)the last occupied location in the array

Explanation: if we implement it using array, then peek returns element from the last occupied location

Quuestion5) -1

Explanation: in array based, -1 indicates that the array is empty

Question 6) recursive method needs a(n) base case

Question 7) ????? (Tested in ecplise ide)

Question 8) O(n)

Question 9)

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

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