Populate sibling pointer in each node for level order traversal - PrismoSkills
Problem: Given a binary tree order, populate sibling pointer in each node so that level order traversal can be done easilyExample: The blue arrows shown below are the sibling pointers (also known as nextRight pointers)
Read full article from Populate sibling pointer in each node for level order traversal - PrismoSkills