leetcode 78: Populating Next Right Pointers in Each Node
Populating Next Right Pointers in Each NodeOct
28 '12
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 toNULL
.
Initially, all next pointers are set to NULL
.
Note:
- You may only use constant extra space.
- You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
For example,
Given the following perfect binary tree,
1 / \ 2 3 / \ / \ 4 5 6 7
After calling your function, the tree should look like:
1 -> NULL / \ 2 -> 3 -> NULL / \ / \ 4->5->6->7 -> NULL
/** * Definition for binary tree with next pointer. * public class TreeLinkNode { * int val; * TreeLinkNode left, right, next; * TreeLinkNode(int x) { val = x; } * } */ public class Solution { public void connect(TreeLinkNode root) { // Start typing your Java solution below // DO NOT write main() function if(root==null) return; root.next = null; nextRec(root.left, root.right); nextRec(root.right, null); return; } private void nextRec(TreeLinkNode root, TreeLinkNode next) { if(root==null) return; root.next = next; nextRec(root.left, root.right); if(next!=null) nextRec(root.right, next.left); else nextRec(root.right, null); } }