Q. A treap is a cartesian tree with

View solution

Q. Cartesian trees solve range minimum query problem in constant time

View solution

Q. Consider below sequences:

array=60 90 10 100 40 150 90

reverse 2 to 3

array=60 10 90 100 40 150 90

reverse 3 to 6

array= 60 100 150 40 100 90 90

now printout from 1 to 6 :-- 60 100 150 40 100 90

How to achieve the above operation efficiently?

View solution

Q. What is a weight balanced tree?

View solution

Q. What are the applications of weight balanced tree?

View solution

Q. A node of the weight balanced tree has

View solution

Q. The size value of various nodes in a weight balanced tree are
leaf – zero

internal node – size of it’s two children

is this true?

View solution

Q. What are splay trees?

View solution

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