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

A. h = O(loglogn)

B. h = O(nlogn)

C. h = O(n)

D. h = O(log n)

A. shift and color

B. skew and split

C. zig and zag

D. enqueue and dequeue

A. connection between node and a child of equal levels

B. connection between two nodes

C. connection between two child nodes

D. connection between root node and leaf node

A. log n

B. n!

C. n²

D. 2 log n + O(1)

A. Merge

B. Cut

C. Expose

D. Link

A.

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

B.

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

C.

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

D.

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

A. true

B. false

A. O (log n)

B. O (n!)

C. O (n²)

D. O (1)

A. True

B. False

A. 0

B. 1

C. 2

D. 4