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 
        }
    };
  • 相关阅读:
    execution(* *..BookManager.save(..))的解读
    metalink下载补丁包
    loop_login.sh
    EXPDP IMPDP 知识总结
    图书管理系统简单 过程
    Data Types
    Oracle 创建分页存储过程(转帖)
    绑定变量赋值
    Oracle10g、 Oracle11g完美共存
    Oracle11G 数据库 expdp、impdp使用示例
  • 原文地址:https://www.cnblogs.com/graph/p/3251831.html
Copyright © 2011-2022 走看看