Populating Next Right Pointers in Each Node

原创 2015年11月20日 16:05:32
  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;
        }
    };


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

Leetcode 116. Populating Next Right Pointers in Each Node

Given a binary treestruct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode...

LeetCode 之 Populating Next Right Pointers in Each Node

看到这个题第一印象是先序遍历嘛,不过有一个非常棘手的问题,即每一行的 最后一个元素不是指向下一行的第一个元素,而是指向NULL,传统的先序遍历如下:                       ...

Populating Next Right Pointers in Each Node Python Java Leetcode

Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; ...

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...

Populating Next Right Pointers in Each Node II (Java)

Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tree could...

Leetcode: Populating Next Right Pointers in Each Node

题目: Given a binary treestruct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLi...

LeetCode 116 Populating Next Right Pointers in Each Node 解题报告

Populating Next Right Pointers in Each Node Total Accepted: 44163 Total Submissions: 122231Given a ...

leetcode116~Populating Next Right Pointers in Each Node

Given a binary treestruct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode...

leetcode:Populating Next Right Pointers in Each Node

题目地址:

Populating Next Right Pointers in Each Node - LeetCode 116

题目描述: Given a binary tree     struct TreeLinkNode {       TreeLinkNode *left;       TreeLinkNode *r...
  • bu_min
  • bu_min
  • 2015年05月22日 21:00
  • 213
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Populating Next Right Pointers in Each Node
举报原因:
原因补充:

(最多只允许输入30个字)