Binary Search Trees(B Tree) MCQ question and answer with solution | Data Structure MCQs

Home / Data Structure / Binary Search Trees(B Tree)

11.
What is the condition for priority of a node in a treap?

Answer & Solution Discuss in Board Save for Later

14.
What is the condition for a tree to be weight balanced. where a is factor and n is a node?

Answer & Solution Discuss in Board Save for Later

15.
Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?

Answer & Solution Discuss in Board Save for Later

17.
Select the code snippet which performs post-order traversal.

public void postorder(Tree root)
{
	System.out.println(root.data);
	postorder(root.left);
	postorder(root.right);
}

public void postorder(Tree root)
{
	postorder(root.left);
	postorder(root.right);
	System.out.println(root.data);
}

public void postorder(Tree root)
{
	System.out.println(root.data);
	postorder(root.right);
	postorder(root.left);
}

public void postorder(Tree root)
{
	postorder(root.right);
        System.out.println(root.data);
	postorder(root.left);
}

Answer & Solution Discuss in Board Save for Later

20.
What does the following piece of code do?
public void func(Tree root)
{
	func(root.left());
	func(root.right());
	System.out.println(root.data());
}

Answer & Solution Discuss in Board Save for Later

Read More Section(Binary Search Trees(B Tree))

Each Section contains maximum 100 MCQs question on Binary Search Trees(B Tree). To get more questions visit other sections.