Java for LeetCode 117 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

解题思路一:

本题的难点在于需要逐层遍历才行,因此可以用Java for LeetCode 102 Binary Tree Level Order Traversal的思路,JAVA实现如下:

    public void connect(TreeLinkNode root) {
    	if (root == null || (root.left == null && root.right == null))
			return;
    	List<List<TreeLinkNode>> list=new ArrayList<List<TreeLinkNode>>();
        Queue<TreeLinkNode> queue = new LinkedList<TreeLinkNode>();
        queue.add(root);
        while (queue.size() != 0) {
            List<TreeLinkNode> alist = new ArrayList<TreeLinkNode>();
            for (TreeLinkNode child : queue)
                alist.add(child);
            list.add(new ArrayList<TreeLinkNode>(alist));
            Queue<TreeLinkNode> queue2=queue;
            queue=new LinkedList<TreeLinkNode>();
            for(TreeLinkNode child:queue2){
                if (child.left != null)
                    queue.add(child.left);
                if (child.right != null)
                    queue.add(child.right);
            }
        }
        for(List<TreeLinkNode> alist:list)
        	for(TreeLinkNode aNode:alist)
        		connectARoot(aNode);
    }
    public static void connectARoot(TreeLinkNode root){
    	if (root == null || (root.left == null && root.right == null))
			return;
		if (root.next == null) {
			if (root.left != null)
				root.left.next = root.right;
		}
		else if (root.right == null) {
			TreeLinkNode temp=root.next;
			while(temp!=null){
				if(temp.left==null&&temp.right==null)
					temp=temp.next;
				else break;
			}
			if(temp!=null)
				root.left.next = (temp.left == null?temp.right:temp.left);
		}else {
			if (root.left != null)
				root.left.next = root.right;
			TreeLinkNode temp=root.next;
			while(temp!=null){
				if(temp.left==null&&temp.right==null)
					temp=temp.next;
				else break;
			}
			if(temp!=null)
				root.right.next = (temp.left == null?temp.right:temp.left);
		}
    }

解题思路二:

不使用队列,请移步Populating Next Right Pointers in Each Node I [email protected]

时间: 2024-10-27 01:09:52

Java for LeetCode 117 Populating Next Right Pointers in Each Node II的相关文章

leetcode 117 Populating Next Right Pointers in Each Node II ----- java

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 tr

LeetCode 117: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 t

LeetCode开心刷题五十五天——117. Populating Next Right Pointers in Each Node II

问题亟待解决: 1.一个问题一直困扰着我,想看下别人是怎么处理树的输入的,最好是以层级遍历这种清楚直观的方式. 2.关于指针*的使用 因此也导致代码不完整,没有主函数对Solution类的调用 117. Populating Next Right Pointers in Each Node II Medium 1161165FavoriteShare Given a binary tree struct Node { int val; Node *left; Node *right; Node

【57】117. Populating Next Right Pointers in Each Node II

117. Populating Next Right Pointers in Each Node II Description Submission Solutions Add to List Total Accepted: 84339 Total Submissions: 251330 Difficulty: Medium Contributors: Admin Follow up for problem "Populating Next Right Pointers in Each Node

Leetcode 树 Populating Next Right Pointers in Each Node II

本文为senlie原创,转载请保留此地址:http://blog.csdn.net/zhengsenlie Populating Next Right Pointers in Each Node II Total Accepted: 9695 Total Submissions: 32965 Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tree could

LeetCode[Tree]: 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 t

【leetcode】Populating Next Right Pointers in Each Node II

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 s

117. 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 tr

[leedcode 117] 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 tr