Populating Next Right Pointers in Each Node

原创 2015年11月20日 23:43:45

题目: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 指向自身 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(root==NULL)  return ;
        if(root->left&&root->right){
            root->left->next=root->right;
        }
        if(root->next&&root->left){//到了非根节点的时候
            root->right->next=root->next->left;
        }
        
        connect(root->left);connect(root->right);
    }
*/    
    void connect(TreeLinkNode *root){
        if(root==NULL)  return ;
        
        while(root&&root->left){
            TreeLinkNode *tmp=root->left;
            while(root){
                root->left->next=root->right;
                if(root->next){
                    root->right->next=root->next->left;
                }
                root=root->next;
            }
            root=tmp;
        }
    }
};


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

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

【116-Populating Next Right Pointers in Each Node(二叉树链接右指针)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Giv...

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

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
  • 223
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Populating Next Right Pointers in Each Node
举报原因:
原因补充:

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