Write efficient methods that take only a reference to the root of a binary tree, T, and

Question:

Write efficient methods that take only a reference to the root of a binary tree, T, and compute:
a. The number of nodes in T.
b. The number of leaves in T.
c. The number of full nodes in T.
What is the running time of your routines?
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: