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

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

81.
What is the below pseudo code trying to do, where pt is a node pointer and root pointer?
redblack(Node root, Node pt) :
  if (root == NULL)
     return pt
 
  if (pt.data < root.data)
  {
      root.left  =   redblack(root.left, pt);
      root.left.parent = root
  }
  else if (pt.data > root.data)
  {
      root.right = redblackt(root.right, pt)
      root.right.parent = root
  }
 return root

Answer & Solution Discuss in Board Save for Later

82.
Select the code snippet which performs pre-order traversal.

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

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

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

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

Answer & Solution Discuss in Board Save for Later

85.
When to choose Red-Black tree, AVL tree and B-trees?

Answer & Solution Discuss in Board Save for Later

88.
What is a complete binary tree?

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.