Request New Subject
Home
Data Structures (DS)
Non Linear Data Structures - Trees
Q. The worst case complexity of deleting any arbitrary node value element from heap is (Solved)
1. O(logn)
2. O(n)
3. O(nlogn)
4. O(n2)
a. O(logn)
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