C++ data structures algorithms. Big O Big OSECTION List appropriate Worst Case B

Question

C++ data structures algorithms. Big O Big OSECTION 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 O(1) underlying data structure B. Traversing a Linked List from the Last Node to the Head Node O(n) o(n 2) C. Look Up of Node in a 100,000 element Binary Search Tree D. Traversing every node in Queue with array as underlying data O(log n) structure E. Accessing key in 1.000.000 element Hash Map O(n log n)

Explanation / Answer

Find the answers and explanations below.

A. 0(1) ->Directly we can go and check Empty(). Single process

B. 0(n) -> linear (time taken to complete is proportional to size of input)

C. 0(log n) -> Binary search runs in at worst logarithmic time, making O(log n) comparisons, where n is the number of elements in the array,

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.