Programmer Question
How can I Prove that number of interval nodes in a binary tree with n leaves ( with each interval node with two children) is n-1 by Induction.
Find the answer here
How can I Prove that number of interval nodes in a binary tree with n leaves ( with each interval node with two children) is n-1 by Induction.
No comments:
Post a Comment