关闭

Populating Next Right Pointers in Each Node(medium)

标签: Populating Next Righ
122人阅读 评论(0) 收藏 举报
分类:

【题目】

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
【题意】

      如果有右孩子,则使其next为右孩子,否则为null

【分析】

       由于只能用常量级别的额外存储空间,所以度搜索是不能用的,因为递归是需要栈的,因此空间复杂度将是 O(logn)。同理广度搜索也不能用,因为队列也是占用空间的,空间占用还高于 O(logn)。但是核心仍然是广度搜索,但是我们可以借用 next 指针,做到不需要队列就能完成广度搜索,如果当前层所有结点的next 指针已经设置好了,那么据此,下一层所有结点的next指针 也可以依次被设置

【实现】

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


参考:

思路:

很棒的一道题,可以认为是先序遍历。

(1)根据题述:左孩子为空,则右孩子一定为空,所以左孩子为空,则return

(2)如果左孩子不为空,则右孩子一定不为空,所以链接左孩子和右孩子即可(左孩子的next赋值为右孩子)

(3)由于先序遍历,所以父节点的next比子节点的next先被设置,故父节点不同的两个子节点进行连接,就可以用到父节点的next,整题的精华便是:root->right->next = root->right

/**
 * 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;
    }
};



0
0
查看评论

【LeetCode-面试算法经典-Java实现】【116-Populating Next Right Pointers in Each Node(二叉树链接右指针)】

【116-Populating Next Right Pointers in Each Node(二叉树链接右指针)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Given a binary tree struct TreeLinkNode { Tr...
  • DERRANTCM
  • DERRANTCM
  • 2015-08-12 06:30
  • 3049

Populating Next Right Pointers in Each Node -- LeetCode

原题链接: http://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node/  这道题是要将一棵树的每一层维护成一个链表,树本身是给定的。其实思路上很接近层序遍历Binary Tree ...
  • linhuanmars
  • linhuanmars
  • 2014-04-12 03:11
  • 10275

Populating Next Right Pointers in Each Node II 任意(非完美)二叉树添加next指针 @LeetCode

这道题有些tricky,有时间回头再研究一下 package Level4; import Utility.TreeLinkNode; /** * Populating Next Right Pointers in Each Node II * * Follow up for p...
  • hellobinfeng
  • hellobinfeng
  • 2013-11-21 04:45
  • 3390

[leetcode] 117. Populating Next Right Pointers in Each Node II 解题报告

题目链接:https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/ Follow up for problem "Populating Next Right Pointers in Eac...
  • qq508618087
  • qq508618087
  • 2016-01-13 06:36
  • 985

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

Populating Next Right Pointers in Each Node Total Accepted: 44163 Total Submissions: 122231Given a binary treestruct TreeLinkNode { TreeLinkNode *l...
  • a363344923
  • a363344923
  • 2015-03-30 20:44
  • 1371

[leetcode]117. Populating Next Right Pointers in Each Node II

注意一个事实:到根节点的左子节点的next要么指向根节点的右子节点(右子节点不为空),要么就指向根节点的next(或者next的next)节点p,直到该p节点具有下一代的节点。也就是说,将每一层的next链上的节点视为兄弟关系,那么子辈的兄弟必然是父辈兄弟的子辈。基于以上事实,采用DFS,注意右子树...
  • zorelemn
  • zorelemn
  • 2016-04-14 16:13
  • 278

[LeetCode]Populating Next Right Pointers in Each Node II, 解题报告

前言 今天上午从9点半开始就做了这么一道题目,还是挺有意思的,这里记录一下 题目 Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tr...
  • zinss26914
  • zinss26914
  • 2013-12-19 11:17
  • 7606

Hard-题目6:117. 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 soluti...
  • cmershen
  • cmershen
  • 2016-05-31 23:24
  • 298

【LeetCode with Python】 Populating Next Right Pointers in Each Node

Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each nex...
  • nerv3x3
  • nerv3x3
  • 2014-07-04 16:26
  • 1288

【LeetCode-面试算法经典-Java实现】【117-Populating Next Right Pointers in Each Node(二叉树链接右指针II)】

【117-Populating Next Right Pointers in Each Node(二叉树链接右指针II)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Follow up for problem “Populating Next Right Pointe...
  • DERRANTCM
  • DERRANTCM
  • 2015-08-13 06:18
  • 2000
    个人资料
    • 访问:26620次
    • 积分:946
    • 等级:
    • 排名:千里之外
    • 原创:58篇
    • 转载:70篇
    • 译文:1篇
    • 评论:1条