[4 pts] Given a random Binary tree of

n

nodes, design a divide-and-conquer algorithm to count the number of leaf nodes inside the tree. Write your pseudo-code clearly and analysis its worst-case, best-case running time in terms of

n

.

7. [4 pts] Given a random Binary tree of n nodes, design a divide-and-conquer algorithm to count the number of leaf nodes inside the tree. Write your pseudo-code clearly and analysis its worst-case, best-case running time in terms of n