What is a weight balanced tree?
A. A binary tree that stores the sizes of subtrees in nodes
B. A binary tree with an additional attribute of weight
C. A height balanced binary tree
D. A normal binary tree
Select an option to see the answer and solution.
What is an AVL tree?
A. a tree which is balanced and is a height balanced tree
B. a tree which is unbalanced and is a height balanced tree
C. a tree with three children
D. a tree with atmost 3 children
Select an option to see the answer and solution.
Which of the following traversing algorithm is not used to traverse in a tree?
A. Post order
B. Pre order
C. Post order
D. Randomized
Select an option to see the answer and solution.
Which is the simplest of all binary search trees?
A. AVL tree
B. Treap
C. Splay tree
D. Binary heap
Select an option to see the answer and solution.
What are the applications of weight balanced tree?
A. dynamic sets, dictionaries, sequences, maps
B. heaps
C. sorting
D. storing strings
Select an option to see the answer and solution.
Identify the reason which doesn't play a key role to use threaded binary trees?
A. The storage required by stack and queue is more
B. The pointers in most of nodes of a binary tree are NULL
C. It is Difficult to find a successor node
D. They occupy less size
Select an option to see the answer and solution.
How many bits would a succinct binary tree occupy?
A. n+O(n)
B. 2n+O(n)
C. n/2
D. n
Select an option to see the answer and solution.
Who developed the concept of tango tree?
A. Erik Demaine
B. Mihai Patrascu
C. John Lacono
D. All of the mentioned
Select an option to see the answer and solution.
Which of the following is the self-adjusting binary search tree?
A. AVL Tree
B. Splay Tree
C. Top Tree
D. Ternary Tree
Select an option to see the answer and solution.
Comparing the speed of execution of Red-Black trees and AA-trees, which one has the faster search time?
A. AA-tree
B. Red-Black tree
C. Both have an equal search time
D. It depends
Select an option to see the answer and solution.
Is insertion and deletion operation faster in rope than an array?
Select an option to see the answer and solution.
Which type of tree is tango tree?
A. Ternary Tree
B. AVL Tree
C. Binary Search Tree
D. K-ary Tree
Select an option to see the answer and solution.
What is the expected number of leaves in a randomized binary search tree?
A. n + 1
B. (n + 1)/3
C. (n + 1)/2
D. n + 3
Select an option to see the answer and solution.
How will you find the maximum element in a binary search tree?
Options are not available for this question.
Select an option to see the answer and solution.
Cartesian trees are most suitable for?
A. searching
B. finding nth element
C. minimum range query and lowest common ancestors
D. self balancing a tree
Select an option to see the answer and solution.
How many types of insertion are performed in a binary tree?
Select an option to see the answer and solution.
What is the probability of selecting a tree uniformly at random?
A. Equal to Catalan Number
B. Less Than Catalan Number
C. Greater than Catalan Number
D. Reciprocal of Catalan Number
Select an option to see the answer and solution.
Which of the following tree traversals work if the null left pointer pointing to the predecessor and null right pointer pointing to the successor in a binary tree?
A. inorder, postorder, preorder traversals
B. inorder
C. postorder
D. preorder
Select an option to see the answer and solution.
AA Trees are implemented using?
A. Colors
B. Levels
C. Node size
D. Heaps
Select an option to see the answer and solution.
What maximum difference in heights between the leafs of a AVL tree is possible?
A. log(n) where n is the number of nodes
B. n where n is the number of nodes
C. 0 or 1
D. atmost 1
Select an option to see the answer and solution.