Question

1. A node that is a descendant of another node is called its

a. root

b. sibling

c. parent

d. child

2. Any node in a tree that does not have any children is refered to as a

a. leaf

b. tail

c. head

d. root

3. A binary search tree is a binary tree with what property?

a. An internal node is greater than all of its children

b. An internal node is less than all of its children

c. Has only two nodes

d. An internal node is greater than one of its children and less than its other one

4. In a binary tree, a node has how many children?

a. 0

b. 1

c. 0, 1, or 2

d. 2

5. The first Node in a binary tree is referred to as the

a. head

b. tail

c. leaf

d. root

Answer 1

ANSWER 1: Here option(D) is correct because A node that is a descendant of another node is called its child.

ANSWER 2: Here option(A) is correct because leaf node at the last part of the tree and they do not have any children.

ANSWER 3: Here option(D) is correct because it is the correct property of the binary search tree because it has left side child which has lower value of that node and greater value at right side child.

ANSWER 4: HEre option(D) is correct because binary means 2 so it has two nodes.

ANSWER 5: First node is always a root node in a tree so option(D) is correct.