C++ List appropriate Worst Case Big O Notation under the different algorithms or

Question

C++

List appropriate Worst Case Big O Notation under the different algorithms or data structure operations. Choose from right column and place under left column. Right column can be used more than once or not all. A. Empty() check method on Stack of 1000 elements with array as underlying data structure O(1) B. Traversing a Linked List from the Last Node to the Head Node O (n) C. Look Up of Node in a 100.000 element Binary Search Tree O(n^2) D. Traversing every node in Queue with array as underlying data structure O(log n) E. Accessing key in 1.000.000 element Hash Map O(n log n)

Explanation / Answer

A. 0(1) -> directly check the Empty() method. so complexity is single unit only

B. 0(n) -> Linear. Based on List size the complexity will directly proportion

C. 0(log n) -> Binary search tree lookups will take this complexity

D. 0(n)

E. 0(1)

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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