zoukankan      html  css  js  c++  java
  • 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

    public class Solution {
    	public void connect(TreeLinkNode root) {
    		if(root != null){
    			root.next = null;
    			TreeLinkNode topLevel = root;
    			TreeLinkNode nextLevelHead = null;
    			TreeLinkNode node = null;
    			while(topLevel != null){
    				//looking for the head of next level
    				while(topLevel != null && nextLevelHead == null){
    					if(topLevel.left != null){
    						nextLevelHead = topLevel.left;
    						node = nextLevelHead;
    					}
    					if(topLevel.right != null){
    						if(node == null){
    							nextLevelHead = topLevel.right;
    							node = nextLevelHead;
    						}
    						else{
    							node.next = topLevel.right;
    							node = node.next;
    						}
    					}
    					
    					topLevel = topLevel.next;
    				}
    				
    				while(topLevel != null){
    					if(topLevel.left != null){
    						node.next = topLevel.left;
    						node = node.next;
    					}
    					if(topLevel.right != null){
    						node.next = topLevel.right;
    						node = node.next;
    					}
    					topLevel = topLevel.next;
    				}
    				
    				if(node != null){
    					node.next = null;
    					node = node.next;
    				}
    				topLevel = nextLevelHead;
    				nextLevelHead = null;
    			}
    		}
        }
    }
    

      

  • 相关阅读:
    Java面向对象基本/传参/引用/访问控制/构造器
    二叉树遍历&分治
    Java基础 & 基本数据类型 & String类
    Java面向对象继承/重写/多态
    Java集合基础
    Java面向对象抽象类/接口类/内部类
    你碰我变
    cookie&&localstorage
    父亲的谎话,只有长大后才能听懂……
    CSS的兼容性
  • 原文地址:https://www.cnblogs.com/averillzheng/p/3769567.html
Copyright © 2011-2022 走看看