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.
- Recursive approach is fine, implicit stack space does not count as extra space for this problem.
- You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
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
Accepted
218,583
Submissions
598,343
/**
* 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;
while(root->left){
TreeLinkNode* p = root;
while(p){
p->left->next=p->right;
if(p->next!=NULL)
p->right->next=p->next->left;
p=p->next;
}
root=root->left;
}
}
};
因为此题交代了一定是完美的二叉树,所以可以用此方法去做。一边定义next的内容,一边运用next指针进行层次遍历的方式。每一层大循环只需访问最左边的结点作为起始结点,以next指针作为小循环的推进。