Binary Tree and BST MCQs

What is the degree of a binary tree node?

• 1

• 2

• Maximum of 2

• At least 1

What is the maximum number of nodes in a binary tree of height $ h $?

• $ 2^h - 1 $

• $ 2^{h+1} - 1 $

• $ 2^{h-1} $

• $ h^2 $

In a binary tree, the number of leaf nodes is:

• Greater than the number of internal nodes.

• Equal to the number of internal nodes.

• One more than the number of internal nodes in a full binary tree.

• Twice the height of the tree.

What is the difference between a complete and a full binary tree?

• A complete binary tree has all levels fully filled.

• A full binary tree has all levels filled except possibly the last.

• A full binary tree has all nodes with 0 or 2 children.

• There is no difference.

If a binary tree has $ N $ nodes, what is the height of the tree in the worst case?

• $ O(\log N) $

• $ O(N) $

• $ O(1) $

• $ O(\sqrt{N}) $

Which of the following trees is not a binary tree?

• AVL tree

• Red-Black tree

• B-tree

• Huffman tree

The minimum height of a binary tree with $ n $ nodes is:

• $ \lfloor \log_2(n+1) \rfloor $

• $ \lceil \log_2(n+1) \rceil $

• $ \log_2 n $

• $ \lfloor \log_2 n \rfloor $

A skewed binary tree has the height of:

• $ O(\log N) $

• $ O(N) $

• $ O(\sqrt{N}) $

• $ O(1) $

What traversal technique is best for printing the nodes in non-decreasing order in a BST?

• Preorder

• Inorder

• Postorder

• Level order

What is the number of binary trees possible with $ n $ nodes?

• $ n! $

• Catalan number $ C_n $

• $ 2^n $

• None of the above.