Top MCQs on Binary Trees Data Structure with Answers (original) (raw)

Any decision tree that sorts n elements has height

The number of structurally different possible binary trees with 4 nodes is

A strictly binary tree with 10 leaves

• cannot have more than 19 nodes

What is the maximum height of any AVL tree with 7 nodes? Assume that height of tree with single node is 0.

Which one of the following property is correct for a red-black tree?

• Every simple path from a node to a descendant leaf contains the same number of black nodes
• If a node is red, then one children is red and another is black
• If a node is red, then both its children are red
• Every leaf node (sentinel node) is red

Consider a full binary tree with n internal nodes, internal path length i, and external path length e. The internal path length of a full binary tree is the sum, taken over all nodes of the tree, of the depth of each node. Similarly, the external path length is the sum, taken over all leaves of the tree, of the depth of each leaf. Which of the following is correct for the full binary tree?

The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ________.

A complete binary tree with n non-leaf nodes contains

Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be

The number of different binary trees with 6 nodes is ______.

There are 52 questions to complete.

Take a part in the ongoing discussion