Leetcode 116. Populating Next Right Pointers in Each Node
题目链接: Populating Next Right Pointers in Each Node
难度:Medium
题目大意:
给出完美二叉树,即除了叶子节点外,每个节点都既有左子树也有右子树,给二叉树中的每个节点增加一个next索引,指向同层的右边节点。
思路:
参考高赞回答,一层一层地遍历节点,设置每个节点子节点的next索引指向。
代码
/*
// 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) {
Node res=root;
while(root!=null&&root.left!=null){//一层一层地遍历
Node cur=root;
while(cur!=null){
cur.left.next=cur.right;
if(cur.next==null){//cur是最右侧的节点
cur.right.next=null;
}
else{
cur.right.next=cur.next.left;
}
cur=cur.next;
}
root=root.left;//进入下一层
}
return res;
}
}