Of the following rules that are followed by an AA-tree, which of the following is incorrect?
Select an option to see the answer and solution.
Which process forms the randomized binary search tree?
A. Stochastic Process
B. Branching Process
C. Diffusion Process
D. Aggregation Process
Select an option to see the answer and solution.
Who is the inventor of AA-Tree?
A. Arne Andersson
B. Daniel Sleator
C. Rudolf Bayer
D. Jon Louis Bentley
Select an option to see the answer and solution.
Which data structure is used to maintain a dynamic forest using a link or cut operation?
A. Top Tree
B. Array
C. Linked List
D. Stack
Select an option to see the answer and solution.
How many common operations are performed in a binary tree?
Select an option to see the answer and solution.
What are the disadvantages of normal binary tree traversals?
A. there are many pointers which are null and thus useless
B. there is no traversal which is efficient
C. complexity in implementing
D. improper traversals
Select an option to see the answer and solution.
What is the reason behind the simplicity of a treap?
A. Each node has data and a pointer
B. Each node is colored accordingly
C. It is a binary search tree following heap principles
D. Each node has a fixed priority field
Select an option to see the answer and solution.
Is Top tree used for maintaining Dynamic set of trees called forest.
Select an option to see the answer and solution.
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?
A. no there is no special usage
B. In real time it is estimated that 80% access is only to 20% data, hence most used ones must be easily available
C. redblack and avl are not upto mark
D. they are just another type of self balancing binary search trees
Select an option to see the answer and solution.
What is the parent for a node 'w' of a complete binary tree in an array representation when w is not 0?
A. floor(w-1/2)
B. ceil(w-1/2)
C. w-1/2
D. w/2
Select an option to see the answer and solution.
The average depth of a binary tree is given as?
A. O(N)
B. O(√N)
C. O(N2 )
D. O(log N)
Select an option to see the answer and solution.
What is the time complexity for deleting the string to form a new string in the rope data structure?
A. O (n2 )
B. O (n!)
C. O (log n)
D. O (1)
Select an option to see the answer and solution.
Associative arrays can be implemented using . . . . . . . .
A. B-tree
B. A doubly linked list
C. A single linked list
D. A self balancing binary search tree
Select an option to see the answer and solution.
What are the operations that can be performed on weight balanced tree?
A. all basic operations and set intersection, set union and subset test
B. all basic operations
C. set intersection, set union and subset test
D. only insertion and deletion
Select an option to see the answer and solution.
Which of the following is false about a binary search tree?
A. The left child is always lesser than its parent
B. The right child is always greater than its parent
C. The left and right sub-trees should also be binary search trees
D. In order sequence gives decreasing order of elements
Select an option to see the answer and solution.
What is the range of β in finding the length of the longest path in a randomized binary search tree?
A. (-1, 0)
B. (1, 0)
C. (0, 5)
D. (0, 1)
Select an option to see the answer and solution.
Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described as
A. log2 n
B. log4/3 n
C. log3 n
D. log3/2 n
Select an option to see the answer and solution.
What is the time complexity for the initialization of top tree?
A. O (n)
B. O (n2 )
C. O (log n)
D. O (n!)
Select an option to see the answer and solution.
How many edges does a leaf cluster contain?
Select an option to see the answer and solution.
If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?
Select an option to see the answer and solution.
