Trees

To represent a hierarchical relationship between elements, which data structure is suitable?

• Tree

• Linked List

• Queue

• Graph

In a tree structure, nodes that are not root and not leaf are known as internal nodes.

• True

• False

Answer explanation

[Root is considered an internal node.]

In a tree structure, a node is a parent if it has successor nodes

• True

• False

…………………. is a directed tree in which out-degree of each node is less than or equal to two

• Binary tree

• Unary tree

• Trinary tree

• Both Unary and Trinary

An empty tree is also a binary tree.

• True

• False

In strictly binary tree, the out-degree of every node is either 0 or 2.

• True

• False

Which of the following statements about binary trees is NOT true?

• Every binary tree has at least one node.

• Every non-empty tree has exactly one root node.

• Every node has at most two children.

• Every non-root node has exactly one parent.

Is this a binary search tree?

• Yes

• No

Answer explanation

[42 should be placed in the left subtree of the root (55)]

The number of edges from the root to the node is called __________ of the tree.

• Height

• Depth

• Length

• Width

The number of edges from the node to the deepest leaf is called_________ of the tree.

• Height

• Depth

• Length

• Width

Answer explanation

[Height is the number of edges from the node to the deepest leaf in the node’s subtree]