47. Find the Size of the Binary Tree

Objective: Given a Binary tree, Find the size of the tree.

Note : The size of the tree is the number of nodes in the tree

Example :

Approach :

1. Very Simple solution
2. Start from the root.
3. Size = 1 (for the root) + Size Of left Sub-Tree + Size Of right Sub-Tree
4. solve the left sub-tree and right sub-tree recursively.

Size of the Tree is: 7

Related Problems:

- Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Hard
- Reverse a Linked List in groups of given size 'K' Medium
- Divide and Conquer - Rearrange array elements in special order Medium
- Inorder Successor in Binary Search Tree Using Parent link Hard
- Inorder Successor in Binary Tree Medium