Q. Which of the following property of splay tree is correct?

View solution

Q. Why to prefer splay trees?

View solution

Q. Is it true that splay trees have O(logn) amortized complexity ?

View solution

Q. What is a splay operation?

View solution

Q. Which of the following options is an application of splay trees?

View solution

Q. When we have red-black trees and AVL trees that can perform most of operations in logarithmic times, then what is the need for splay trees?

View solution

Q. What is the disadvantage of using splay trees?

View solution

Q. What is a threaded binary tree traversal?

View solution

Q. What are the disadvantages of normal binary tree traversals?

View solution

Q. What may be the content of a node in threaded binary tree?

View solution

Q. What are null nodes filled with in a threaded binary tree?

View solution

Q. The null left pointer pointing to predecessor and null right pointer pointing to successor. how many types of threaded tree are possible with this convention?

View solution

Q. What are double and single threaded trees?

View solution

Q. In a max-heap, element with the greatest key is always in the which node?

View solution

Q. Heap exhibits the property of a binary tree?

View solution

Q. What is the complexity of adding an element to the heap.

View solution

Q. The worst case complexity of deleting any arbitrary node value element from heap is

View solution

Q. Heap can be used as ________________

View solution

Q. An array consist of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of

View solution

Q. What is the space complexity of searching in a heap?

View solution