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


    因此,对一个节点需要向右找到第一个节点。

    对于left,如果right不存在,就在father的next节点去找left/right,依次找下去。

    对于right,直接在father的next节点开始找。

     1 /**
     2  * Definition for binary tree with next pointer.
     3  * public class TreeLinkNode {
     4  *     int val;
     5  *     TreeLinkNode left, right, next;
     6  *     TreeLinkNode(int x) { val = x; }
     7  * }
     8  */
     9 public class Solution {
    10     TreeLinkNode node;
    11     public void connect(TreeLinkNode root) {
    12         if (root==null) {
    13             return;
    14         }
    15 
    16         TreeLinkNode left = root.left;
    17         TreeLinkNode right = root.right;
    18 
    19         if (left != null) {
    20             left.next = right;
    21             if (right == null) {
    22                 node = root.next;
    23                 while (node != null && left.next == null) {
    24                     left.next = node.left;
    25                     if (left.next == null) {
    26                         left.next = node.right;
    27                     }
    28                     node = node.next;
    29                 }
    30             }
    31         }
    32 
    33         if (right != null) {
    34             node = root.next;
    35             while (node != null && right.next == null) {
    36                 right.next = node.left;
    37                 if (right.next == null) {
    38                     right.next = node.right;
    39                 }
    40                 node = node.next;
    41             }
    42         }
    43 
    44         connect(right);
    45         connect(left);
    46     }
    47 }
  • 相关阅读:
    PerfDog WEB端使用手册
    PerfDog4.0探索,支持用户自建web云
    无AI不测试:人工智能时代背景下,如何发展与应用自动化测试?
    性能测试实践 | PerfDog助力微信小游戏/小程序性能调优
    mysql面向过程学习
    阿里云操作记录
    socket网络编程
    学习慕课广告系统
    xinhuadouxxx总结
    maven+springboot+mybatis快速搭建简单使用
  • 原文地址:https://www.cnblogs.com/birdhack/p/4158823.html
Copyright © 2011-2022 走看看