zoukankan      html  css  js  c++  java
  • Populating Next Right Pointers in Each Node I&&II ——II仍然需要认真看看

    Populating Next Right Pointers in Each Node I

    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
    

    乍一看很难,理清思路后很简单的。

    /**
     * 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) {
            if(root==NULL||root->left==NULL)
                return;
            root->left->next=root->right;
            if(root->next!=NULL)
                root->right->next=root->next->left;
            connect(root->left);
            connect(root->right);
            return ;
        }
    };

     

    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) {
            if(NULL == root) return;
            TreeLinkNode* start;
            TreeLinkNode* curNode;
            TreeLinkNode* nextNode;
            while(root != NULL){
                start = findStartNodeNextLev(root);
                curNode = start;
                nextNode = findNextNodeNextLev(root, start);
                while(nextNode != NULL){
                    curNode -> next = nextNode;
                    curNode = nextNode;
                    nextNode = findNextNodeNextLev(root, curNode);
                }
                root = start;
            }
        }
    private:
        TreeLinkNode* findNextNodeNextLev(TreeLinkNode* &cur, TreeLinkNode* curNextLev){
            if(cur -> left == curNextLev && cur -> right != NULL){
                return cur -> right;
            }else{
                while(cur -> next != NULL){
                    cur = cur -> next;
                    if(cur -> left != NULL && cur -> left != curNextLev) return cur -> left;
                    if(cur -> right != NULL && cur -> right != curNextLev) return cur -> right;
                }
            }
            return NULL;
        }
        
        TreeLinkNode* findStartNodeNextLev(TreeLinkNode* node){
            if(NULL == node) return NULL;
            if(node -> left != NULL) return node -> left;
            return findNextNodeNextLev(node, node -> left);
        }
    };

      

  • 相关阅读:
    hihoCoder #1176 : 欧拉路·一 (简单)
    228 Summary Ranges 汇总区间
    227 Basic Calculator II 基本计算器II
    226 Invert Binary Tree 翻转二叉树
    225 Implement Stack using Queues 队列实现栈
    224 Basic Calculator 基本计算器
    223 Rectangle Area 矩形面积
    222 Count Complete Tree Nodes 完全二叉树的节点个数
    221 Maximal Square 最大正方形
    220 Contains Duplicate III 存在重复 III
  • 原文地址:https://www.cnblogs.com/qiaozhoulin/p/4746862.html
Copyright © 2011-2022 走看看