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:
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
思路：这道题和Populating Next Right Pointers in Each Node思路差不多，就是现在不是完全二叉树，不过一样适用。
/** * 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) { queue<TreeLinkNode*> qroot; if(root==NULL) return; qroot.push(root); qroot.push(NULL); while(qroot.size()) { TreeLinkNode* currentNode=qroot.front(); qroot.pop(); if(currentNode) { currentNode->next=qroot.front(); if(currentNode->left) qroot.push(currentNode->left); if(currentNode->right) qroot.push(currentNode->right); } else { if(qroot.size()) { qroot.push(NULL); } } } } };
Populating Next Right Pointers in Each Node II,布布扣,bubuko.com
Populating Next Right Pointers in Each Node II
原文：http://www.cnblogs.com/awy-blog/p/3651015.html