Write the algorithm that finds the number of leaf nodes in a binary tree, that is, nodes that have no children, given a pointer to the root node, as pseudocode. Solve by writing the "recurrence" equation of your algorithm and write down the time complexity please.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here