Disadvantages of linked list representation of binary trees over arrays?
A. Randomly accessing is not possible
B. Extra memory for a pointer is needed with every element in the list
C. Difficulty in deletion
D. Random access is not possible and extra memory with every element
Select an option to see the answer and solution.
AA-Trees makes more rotations than a red-black tree.
Select an option to see the answer and solution.
If A ꓵ B (A and B are two clusters) is a singleton set then it is a Merge able cluster.
Select an option to see the answer and solution.
Which of the following is not a random tree?
A. Treap
B. Random Binary Tree
C. Uniform Spanning Tree
D. AVL Tree
Select an option to see the answer and solution.
How many edges are present in path cluster?
Select an option to see the answer and solution.
Which of the following is a self - balancing binary search tree?
A. 2-3 tree
B. Threaded binary tree
C. AA tree
D. Treap
Select an option to see the answer and solution.
Consider the following data and specify which one is Preorder Traversal Sequence, Inorder and Postorder sequences.
S1: N, M, P, O, Q
S2: N, P, Q, O, M
S3: M, N, O, P, Q
A. S1 is preorder, S2 is inorder and S3 is postorder
B. S1 is inorder, S2 is preorder and S3 is postorder
C. S1 is inorder, S2 is postorder and S3 is preorder
D. S1 is postorder, S2 is inorder and S3 is preorder
Select an option to see the answer and solution.
Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?
A. no they are not preferred
B. because of resizing issues of hash table and better ordering in redblack trees
C. because they can be implemented using trees
D. because they are balanced
Select an option to see the answer and solution.
The number of edges from the node to the deepest leaf is called . . . . . . . . of the tree.
A. Height
B. Depth
C. Length
D. Width
Select an option to see the answer and solution.
Which property makes top tree a binary tree?
A. Nodes as Cluster
B. Leaves as Edges
C. Root is Tree Itself
D. All of the mentioned
Select an option to see the answer and solution.
The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?
A. L N M O Q P T
B. N M O P O L T
C. L M N O P Q T
D. O P L M N Q T
Select an option to see the answer and solution.
After the insertion operation, is the resultant tree a splay tee?
Select an option to see the answer and solution.
What are splay trees?
A. self adjusting binary search trees
B. self adjusting binary trees
C. a tree with strings
D. a tree with probability distributions
Select an option to see the answer and solution.
What is the time complexity for finding the node at x position where n is the length of the rope?
A. O (log n)
B. O (n!)
C. O (n2 )
D. O (1)
Select an option to see the answer and solution.
What are the children for node 'w' of a complete-binary tree in an array representation?
A. 2w and 2w+1
B. 2+w and 2-w
C. w+1/2 and w/2
D. w-1/2 and w+1/2
Select an option to see the answer and solution.
Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is . . . . . . . .
A. A, C, D, B, E
B. A, B, C, D, E
C. A, B, C, E, D
D. D, B, E, A, C
Select an option to see the answer and solution.
Which type of binary search tree is imitated for construction of tango tree?
A. Complete Binary Search Tree
B. Perfect Binary Search Tree
C. Balanced Binary Search Tree
D. Degenerate Binary Search Tree
Select an option to see the answer and solution.
A binary tree is balanced if the difference between left and right subtree of every node is not more than . . . . . . . .
Select an option to see the answer and solution.
What are the conditions for an optimal binary search tree and what is its advantage?
A. The tree should not be modified and you should know how often the keys are accessed, it improves the lookup cost
B. You should know the frequency of access of the keys, improves the lookup time
C. The tree can be modified and you should know the number of elements in the tree before hand, it improves the deletion time
D. The tree should be just modified and improves the lookup time
Select an option to see the answer and solution.
Which of the following property of splay tree is correct?
A. it holds probability usage of the respective sub trees
B. any sequence of j operations starting from an empty tree with h nodes atmost, takes O(jlogh) time complexity
C. sequence of operations with h nodes can take O(logh) time complexity
D. splay trees are unstable trees
Select an option to see the answer and solution.