Solve the question given below
Prove that, when a binary tree with n nodes is implemented by using links to the left and right child, then there will be a total of n+1 null links.
(Hint: use induction)
The response must be typed, single spaced, must be in times new roman font (size 12) and must follow the APA format.