Q101
Open questionWhat is a splay operation?
Select an option to see the answer and solution.
Data Structure · all questionsBinary Search Trees(B Tree)
Binary Search Trees(B Tree)
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
275
Questions
6/14
Page
Pick an option on a question to see the right answer and solution.
Q102
Open questionThe following given tree is an example for?
Select an option to see the answer and solution.
Q103
Open questionThe steps for finding post-order traversal are traverse the right subtree, traverse the left subtree or visit the current node.
Select an option to see the answer and solution.
Q104
Open questionBinary tree sort implemented using a self balancing binary search tree takes O(n log n) time in the worst case but still it is slower than merge sort.
Select an option to see the answer and solution.
Q105
Open questionWhat operation does the following diagram depict?
Select an option to see the answer and solution.
Q106
Open questionWhat is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order.
Select an option to see the answer and solution.
Q107
Open questionThe size value of various nodes in a weight balanced tree are
leaf - zero
internal node - size of it's two children
is this true?
leaf - zero
internal node - size of it's two children
is this true?
Select an option to see the answer and solution.
Q108
Open questionWhy is heap implemented using array representations than tree(linked list) representations though both tree representations and heaps have same complexities?
for binary heap
-insert: O(log n)
-delete min: O(log n)
for a tree
-insert: O(log n)
-delete: O(log n)Select an option to see the answer and solution.
Q109
Open questionAVL trees are more balanced than Red-black trees.
Select an option to see the answer and solution.
Q110
Open questionWhich algorithm is used in the top tree data structure?
Select an option to see the answer and solution.
Q111
Open questionWhat is the condition for priority of a node in a treap?
Select an option to see the answer and solution.
Q112
Open questionWhat is the longest length path for a node x in random binary search tree for the insertion process?
Select an option to see the answer and solution.
Q113
Open questionWhich of the following options is an application of splay trees?
Select an option to see the answer and solution.
Q114
Open questionWhat is the condition for a tree to be weight balanced. where a is factor and n is a node?
Select an option to see the answer and solution.
Q115
Open questionGiven an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?
Select an option to see the answer and solution.
Q116
Open questionA binary tree is a rooted tree but not an ordered tree.
Select an option to see the answer and solution.
Q117
Open questionSelect the code snippet which performs post-order traversal.
Options are not available for this question.
Select an option to see the answer and solution.
Q118
Open questionHow many children does a binary tree have?
Select an option to see the answer and solution.
Q119
Open questionCartesian trees solve range minimum query problem in constant time.
Select an option to see the answer and solution.
Q120
Open questionWhat does the following piece of code do?
public void func(Tree root)
{
func(root.left());
func(root.right());
System.out.println(root.data());
}Select an option to see the answer and solution.