Solution Review: Check Completeness of Tree using Recursion

Solution

We can solve this problem through recursion by treating the given tree like a heap. If we consider that the parent node is present at the location index then the left child location should be at 2*index +1 and the right child location should be at 2*index +2. If it is true for every node then we have a complete tree. Let’s see this approach in action.