标签：leetcode   c++   tree   dfs   

欢迎大家阅读参考，如有错误或疑问请留言纠正，谢谢

Populating Next Right Pointers in Each Node

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


根据题意可知，该树为满二叉树。
所以left->next = right, right->next = father->next->left

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

leetcode_116_Populating Next Right Pointers in Each Node

标签：leetcode   c++   tree   dfs   

原文地址：http://blog.csdn.net/keyyuanxin/article/details/44115339