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的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。