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
    

      

    /**
     * Definition for binary tree with next pointer.
     * struct TreeLinkNode {
     *  int val;
     *  TreeLinkNode *left, *right, *next;
     *  TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
     * };
     */
    class Solution {
    public:
        void connect(TreeLinkNode *root) {
            // Start typing your C/C++ solution below
            // DO NOT write int main() function
            while(root){
                TreeLinkNode *head = NULL;
                TreeLinkNode *pre  = NULL;
                for(;root;root = root->next){
                    if(!head) head = root->left ? root->left : root->right;
                    
                    if(root->left){
                        if(pre)pre->next = root->left;
                        pre = root->left;
                    }
                    
                    if(root->right){
                        if(pre) pre->next = root->right;
                        pre = root->right;
                    }
                }// end of for    
                root = head;
            } // end of while 
        }
    };
  • 相关阅读:
    python-杂烩
    24 Python 对象进阶
    23 Python 面向对象
    22 Python 模块与包
    21 Python 异常处理
    20 Python 常用模块
    18 Python 模块引入
    2 Python 基本语法
    1 Python 环境搭建
    3 Python os 文件和目录
  • 原文地址:https://www.cnblogs.com/graph/p/3251831.html
Copyright © 2011-2022 走看看