Binary Tree and BST MCQs

1

2

Maximum of 2

At least 1

$ 2^h - 1 $

$ 2^{h+1} - 1 $

$ 2^{h-1} $

$ h^2 $

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.

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.

$ O(\log N) $

$ O(N) $

$ O(1) $

$ O(\sqrt{N}) $

AVL tree

Red-Black tree

B-tree

Huffman tree

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

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

$ \log_2 n $

$ \lfloor \log_2 n \rfloor $

$ O(\log N) $

$ O(N) $

$ O(\sqrt{N}) $

$ O(1) $

Preorder

Inorder

Postorder

Level order

$ n! $

Catalan number $ C_n $

$ 2^n $

None of the above.