Suppose a binary tree is implemented as a linked structure in which each node co

Suppose a binary tree is implemented as a linked structure in which each node contains both a left child pointer and a right child pointer. Which of the following statements is false?

   A. The number of nodes in the tree is always at least the number of nodes on the longest path in
the tree.

B. The number of null pointers in the tree is always greater than the number of nodes in the tree.

C. Each terminal node in the tree is always at the end of a path that is as least as long as any other path in the tree.

D. Both the left child and right child pointers of every terminal node are null.

This is for my computing programming course