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

A. True

B. False

A. Ternary Tree

B. AVL Tree

C. Binary Search Tree

D. K-ary Tree

A. n + 1

B. (n + 1)/3

C. (n + 1)/2

D. n + 3

A.

public void max(Tree root)
{
	while(root.left() != null)
	{
		root = root.left();
	}
	System.out.println(root.data());
}

B.

public void max(Tree root)
{
	while(root != null)
	{
		root = root.left();
	}
	System.out.println(root.data());
}

C.

public void max(Tree root)
{
	while(root.right() != null)
	{
		root = root.right();
	}
	System.out.println(root.data());
}

D.

public void max(Tree root)
{
	while(root != null)
	{
		root = root.right();
	}
	System.out.println(root.data());
}

A. searching

B. finding nth element

C. minimum range query and lowest common ancestors

D. self balancing a tree

A. 1

B. 2

C. 3

D. 4

A. Equal to Catalan Number

B. Less Than Catalan Number

C. Greater than Catalan Number

D. Reciprocal of Catalan Number

A. inorder, postorder, preorder traversals

B. inorder

C. postorder

D. preorder

A. Colors

B. Levels

C. Node size

D. Heaps

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