Populate Next Right Pointers Tree

Asked in:
Microsoft
Amazon

Problem Description

Given a binary tree

    struct TreeLinkNode {
      TreeLinkNode *left;
      TreeLinkNode *right;
      TreeLinkNode *next;
    }

Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.
Initially, all next pointers are set to NULL.

NOTE:

You may only use constant extra space.
Recursion has memory overhead and does not qualify for constant space.
The tree need not be a perfect binary tree.

Input Format

The first argument is TreeNode A, pointing to the root of the tree.

Output Format

Update the given TreeNode A.

Example Input

Example Output

         1 -> NULL
       /  \
      2 -> 3 -> NULL
     / \  / \
    4->5->6->7 -> NULL

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.

Start solving Populate Next Right Pointers Tree on Interview Code Editor

Hints

Hint 1
Solution Approach
Complete Solution

Asked In:

Populate Next Right Pointers Tree

Discussion