Which of the following statements is INCORRECT with respect to a binary tree?

NVS Computer Science / IT Teacher Recruitment · 2019 · PGT Computer Science · Computer Science or Information Technology

1. A.

   The height of a node is the number of edges from the node to the deepest leaf.

2. B.

   The height of a tree is a height of the root.

3. C.

   The depth of a node is the number of edges from the root to the node.

4. D.

   A full binary tree is a binary tree in which each node has exactly two children.

Attempted by 24 students.