Request New Subject
Home
Data Structures (DS)
Non Linear Data Structures - Trees
Q. What is the complexity of adding an element to the heap. (Solved)
1. O(log n)
2. O(h)
3. O(log n) & O(h)
4. O(n)
c. O(log n) & O(h)
Related Topics
→ Linear Data Structures -Stacks and Queues
→ Non Linear Data Structures - Graphs
→ Searching, Sorting and Hashing Techniques
Subscribe Now
Get All Updates & News
Subscribe