zoukankan      html  css  js  c++  java
  • Populating Next Right Pointers in Each Node

    Given a binary tree

        struct TreeLinkNode {
          TreeLinkNode *left;
          TreeLinkNode *right;
          TreeLinkNode *next;
        }
    

    Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.

    Initially, all next pointers are set to NULL.

    Note:

    • You may only use constant extra space.
    • You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).

    For example,
    Given the following perfect binary tree,

             1
           /  
          2    3
         /   / 
        4  5  6  7
    

    After calling your function, the tree should look like:

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

    思路:用两个TreeLinkNode:node和across。其中node用来纵向扫,across用来横向扫(利用有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 {
        public void connect(TreeLinkNode root) 
        {
            TreeLinkNode node = root;
            while(node != null)
            {
                TreeLinkNode across = node;
                while(across != null)
                {
                    if(across.left != null)
                    {
                        across.left.next = across.right;
                    }
                    if(across.right !=null && across.next != null)
                    {
                        across.right.next = across.next.left;
                    }
                    across = across.next;
                }
                node = node.left;
            }  
        }
    }

    reference:https://leetcode.com/discuss/1808/may-only-constant-extra-space-does-mean-cannot-use-recursion

  • 相关阅读:
    SQL——SELECT、UPDATE、DELETE和INSERT INTO
    Java——关键字instanceof
    Linux——vim操作
    Java——变量自增(++)自减(--)
    Maven——pom.xml文件报错:Missing artifact:jar包
    Linux清空文件内容
    MySQL数据库传输BLOB类型数据丢失 解决办法
    【转载】StringUtils方法介绍
    Maven学习记录
    Hibernate中自带ID的generator的含义
  • 原文地址:https://www.cnblogs.com/hygeia/p/5100907.html
Copyright © 2011-2022 走看看