leetCode练习（116）

题目：Populating Next Right Pointers in Each Node          

难度：medium

问题描述：

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.
• 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) {
        LinkedList<TreeLinkNode> list=new LinkedList<>();
        DFS(root,0,list);
    }
    private void DFS(TreeLinkNode root,int level,LinkedList<TreeLinkNode> list){
		if(root==null)	return;
		if(list.size()<=level){
			list.add(root);
		}else{
			TreeLinkNode temp=list.get(level);
			temp.next=root;
			list.remove(level);
			list.add(level, root);	
		}
		DFS(root.left,level+1,list);
		DFS(root.right,level+1,list);
	}
}