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 be any binary tree?

Would your previous solution still work?

Note:

You may only use constant extra space.

For example,
Given the following binary tree,

         1/  \2    3/ \    \4   5    7

After calling your function, the tree should look like:

         1 -> NULL/  \2 -> 3 -> NULL/ \    \4-> 5 -> 7 -> NULL

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

转载于:https://www.cnblogs.com/yxwkf/p/5079905.html

leetcode - Populating Next Right Pointers in Each Node II相关推荐

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 ...
LeetCode Populating Next Right Pointers in Each Node II(dfs)
问题:给出一个二叉查找树,将结点与其右边的结点相连思路: 从顶向上,从右向左的方式 .递归过程中,在当前结点及父结点作为参数传递.在向下的过程中,如果父结点不为空则获取当前结点的next结点.如果当 ...
【To Understand!】LeetCode 117. Populating Next Right Pointers in Each Node II
LeetCode 117. Populating Next Right Pointers in Each Node II Solution1:我的答案层次遍历 /*** Definition for ...
117 Populating Next Right Pointers in Each Node II
117 Populating Next Right Pointers in Each Node II 就是 Bibary Tree Level order Traverse class Solutio ...
LeetCode 117. Populating Next Right Pointers in Each Node II
原题链接在这里:https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/ 题目: Given a bi ...
LeetCode OJ - Populating Next Right Pointers in Each Node II
题目: Follow up for problem "Populating Next Right Pointers in Each Node". What if the given ...
[Leetcode][JAVA] Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tre ...
Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tre ...
117. Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tre ...

leetcode - Populating Next Right Pointers in Each Node II

leetcode - Populating Next Right Pointers in Each Node II相关推荐

最新文章

热门文章