问题描述:
解题思路:
把每一层的节点穿起来即可 ,先把属于同一个父节点的左右两个节点穿起来(4->5,6->7)。在把不属于一个父节点的穿起来(5->6)。
解题结果:
/*
// Definition for a Node.
class Node {
public int val;
public Node left;
public Node right;
public Node next;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, Node _left, Node _right, Node _next) {
val = _val;
left = _left;
right = _right;
next = _next;
}
};
*/
class Solution {
public Node connect(Node root) {
if(root == null){
return null;
}
connectTwoNode(root.left,root.right);
return root;
}
void connectTwoNode(Node left,Node right){
if(left == null || right == null){
return ;
}
left.next = right;
connectTwoNode(left.left,left.right);
connectTwoNode(right.left,right.right);
connectTwoNode(left.right,right.left);
}
}