[LeetCode]Populating Next Right Pointers in Each Node II

Follow up for problem "Populating Next Right Pointers in Each Node".

What if the given tree could be any binary tree? Would your previous solution still work?

Note:

  • You may only use constant extra space.

For example,
Given the following binary tree,

         1
       /  \
      2    3
     / \    \
    4   5    7

After calling your function, the tree should look like:

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

利用宽搜顺序搜索每一行的二叉树,然后利用深搜搜索该节点的下一个next节点。


/**
 * Definition for binary tree with next pointer.
 * public class TreeLinkNode {
 *     int val;
 *     TreeLinkNode left, right, next;
 *     TreeLinkNode(int x) { val = x; }
 * }
 */
public class Solution {
	Queue<TreeLinkNode> que = new LinkedList<>();
	public void connect(TreeLinkNode root) {
		if (root == null)
			return;
		que.offer(root);
		while (!que.isEmpty()) {
			TreeLinkNode tln = que.poll();
			if (tln.left != null) {
				que.offer(tln.left);
				tln.left.next = dfs2(tln);
			}
			if (tln.right != null) {
				que.offer(tln.right);
				tln.right.next = dfs3(tln.next);
			}
		}
	}
	
	private TreeLinkNode dfs2(TreeLinkNode root){
		if(root == null) return null;
		if(root.right!=null) return root.right;
		if(root.next!=null&&root.next.left!=null){
			return root.next.left;
		}
		return dfs2(root.next);
	}
	
	private TreeLinkNode dfs3(TreeLinkNode root){
		if(root ==null) {
			return null;
		}else{
			if(root.left!=null) return root.left;
			if(root.right!=null)return root.right;
		}
		return dfs3(root.next);
	}
}

递归:参考 戴方勤 LeetCode题解


/**
 * 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) {
		if(root == null) return;
		TreeLinkNode dummy = new TreeLinkNode(-1);
		for(TreeLinkNode cur=root,fut=dummy;cur!=null;cur=cur.next){
			if(cur.left!=null){
				fut.next = cur.left;
				fut = fut.next;
			}
			if(cur.right!=null){
				fut.next = cur.right;
				fut = fut.next;
			}
		}
		connect(dummy.next);
	}
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值