The number of null pointers in a binary tree with k internal nodes is

1.7 The number of null pointers in a binary tree with k internal nodes is
A) k + 1
B) k – 1
C) k
D) The number depends on the slope of the tree