Populating Next Right Pointers in Each Node II
来源:互联网 发布:js arguments foreach 编辑:程序博客网 时间:2024/03/29 00:03
/** * 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 || (root->left==NULL && root->right==NULL) ) return; TreeLinkNode *tmp = root; TreeLinkNode *tmp2 = NULL; TreeLinkNode *next = NULL; while(root) { tmp2 = NULL; if(root->left && root->right) { root->left->next = root->right; tmp2 = root->right; } else if(root->left == NULL) { tmp2 = root->right; tmp2->next = NULL; } else if(root->right == NULL) { tmp2 = root->left; tmp2->next = NULL; } TreeLinkNode *tmp3 = root->next; while(tmp3) { if(tmp3->left || tmp3->right) { tmp2->next = ((tmp3->left != NULL) ? tmp3->left:tmp3->right); next = tmp3; break; } tmp3 = tmp3->next; } root = tmp3; } if(tmp->left) connect(tmp->left); if(tmp->right) connect(tmp->right); }};
0 0
- Populating Next Right Pointers in Each Node、Populating Next Right Pointers in Each Node II
- 【LeetCode】Populating Next Right Pointers in Each Node Populating Next Right Pointers in Each Node II
- LeetCode Populating Next Right Pointers in Each Node II
- [Leetcode] Populating Next Right Pointers in Each Node II
- [LeetCode] Populating Next Right Pointers in Each Node II
- leetcode 79: Populating Next Right Pointers in Each Node II
- [Leetcode] Populating Next Right Pointers in Each Node ii
- leetcode Populating Next Right Pointers in Each Node II
- 【leetcode】Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node II
- [Leetcode]Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node (I & II)
- Populating Next Right Pointers in Each Node II
- C++中的句柄 -学习笔记(从其他地方参考的)
- 【iFD转载】Xcode添加字体库
- C++之我是二代我继承——点线
- java中public,private,protect,default区别
- 浮点数输出格式问题
- Populating Next Right Pointers in Each Node II
- ODBC实现动态建库和切库
- 学习中遇到与解决php和html的问题
- Android环境搭建之Android Studio
- 微创网站工作总结:用错地方的资源
- envi 读取.ROI 文件,然后转化为.txt 坐标文件
- 原来我不是一个天才
- Windows 7桌面显示图标窗口句柄的获取
- mysql使用基础 sql语句(一)