Populating Next Right Pointers in Each Node题解
2015-01-17 16:33
288 查看
题目:
Given a binary tree
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
Initially, all next pointers are set to
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,
After calling your function, the tree should look like:
我的解法:
(1)算法思想:
如果一个结点root非空且有左结点,将左结点指向右结点,递归connect左结点;如果root的next结点非空,则将root的右结点指向root->next的左结点,再递归connect 右结点。
(2)代码如下:
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
我的解法:
(1)算法思想:
如果一个结点root非空且有左结点,将左结点指向右结点,递归connect左结点;如果root的next结点非空,则将root的右结点指向root->next的左结点,再递归connect 右结点。
(2)代码如下:
/** * 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)return; if(root&&root->left){ root->left->next=root->right; connect(root->left); root->right->next=root->next?root->next->left:NULL; connect(root->right); } } };
相关文章推荐
- 【题解】【BT】【Leetcode】Populating Next Right Pointers in Each Node
- [LeetCode]题解(python):117-Populating Next Right Pointers in Each Node II
- Leetcode:populating_next_right_pointers_in_each_node题解
- LeetCode题解:Populating Next Right Pointers in Each Node I and II
- LeetCode题解:Populating Next Right Pointers in Each Node
- [LeetCode]题解(python):116-Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node II ---LeetCode
- Populating Next Right Pointers in Each Node I & II
- leetcode116~Populating Next Right Pointers in Each Node
- leetcode第34.35题(populating-next-right-pointers-in-each-node)
- Leetcode 116 Populating Next Right Pointers in Each Node 二叉树填充next指针指向右侧结点
- [leetcode] Populating Next Right Pointers in Each Node II
- Leetcode在线编程 populating-next-right-pointers-in-each-node
- 【leetcode】Populating Next Right Pointers in Each Node
- Leetcode - Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- 117. Populating Next Right Pointers in Each Node II
- [LeetCode] Populating Next Right Pointers in Each Node