Write pseudo$-$code for a divide$-$and$-$conquer algorithm that finds the number of

levels in a binary tree. The algorithm should return $0,$ if it$$s empty, and $1,$ if there

is only one node.

$($b$)$ What$$s the time efficiency of your algorithm?

CS $421-$ Algorithms