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

     1 /**
     2  * Definition for binary tree with next pointer.
     3  * struct TreeLinkNode {
     4  *  int val;
     5  *  TreeLinkNode *left, *right, *next;
     6  *  TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
     7  * };
     8  */
     9 class Solution {
    10 public:
    11     void connect(TreeLinkNode *root) {
    12         // Start typing your C/C++ solution below
    13         // DO NOT write int main() function
    14         if (root == NULL)
    15             return;
    16             
    17         TreeLinkNode *p = root;
    18         TreeLinkNode *q = NULL;
    19         TreeLinkNode *nextNode = NULL;
    20         
    21         while(p)
    22         {
    23             if (p->left)
    24             {
    25                 if (q)
    26                     q->next = p->left;                
    27                 q = p->left;
    28                 if (nextNode == NULL)
    29                     nextNode = q;
    30             }
    31             
    32             if (p->right)
    33             {
    34                 if (q)
    35                     q->next = p->right;
    36                 q = p->right;
    37                 if (nextNode == NULL)
    38                     nextNode = q;
    39             }
    40             
    41             p = p->next;
    42         }
    43         
    44         connect(nextNode);
    45     }
    46 };
  • 相关阅读:
    Java——HashMap
    Java——Collections
    Java——String,StringBuffer,StringBuilder
    OpenModelica读取文件
    Excel 常用设置
    Ubuntu16 源码方式安装postgresql数据库
    Utunbu常见问题
    PostgreSQL 扩展开发基础教程
    《数据挖掘导论》
    高性能MySQL --- 读书笔记(2)
  • 原文地址:https://www.cnblogs.com/chkkch/p/2787857.html
Copyright © 2011-2022 走看看