关闭

Populating Next Right Pointers in Each Node

标签: 二叉树
122人阅读 评论(0) 收藏 举报
分类:
  1. 问题

    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
    
  2. 解答
    class Solution {
    public:
        void connect(TreeLinkNode *root) 
        {
            if(root==NULL) return ;
            ret=levelOrder(root);
            
            for(int i=0;i<ret.size();i++)
            {
                for(int j=0;j<ret[i].size()-1;j++)
                {
                    ret[i][j]->next=ret[i][j+1];
                }
                ret[i][ret[i].size()-1]=NULL;
            }
            
            
        }
    private:
        vector<vector<TreeLinkNode *>> ret;
    public:
        void solve(int dep, TreeLinkNode *root)
        {
            if (root == NULL)
                return;
                
            if (ret.size() > dep)
            {
                ret[dep].push_back(root);
            }
            else
            {
                vector<TreeLinkNode *> a;
                a.push_back(root);
                ret.push_back(a);
            }
            
            solve(dep + 1, root->left);
            solve(dep + 1, root->right);
        }
        
        vector<vector<TreeLinkNode *>> levelOrder(TreeLinkNode *root) {
            // Start typing your C/C++ solution below
            // DO NOT write int main() function
            ret.clear();
            solve(0, root);
            
            return ret;
        }
    };


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:10680次
    • 积分:522
    • 等级:
    • 排名:千里之外
    • 原创:42篇
    • 转载:7篇
    • 译文:0篇
    • 评论:0条