[leetcode] Populating Next Right Pointers in Each Node II
来源:互联网 发布:淘宝开店详细流程 编辑:程序博客网 时间:2024/05/01 11:49
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) {} * }; */class Solution {public: void connect(TreeLinkNode *root) { if (root == NULL) return; root->next = NULL; // 先右后左,切记 connect(root, root->right, 1); connect(root, root->left, 0); } void connect(TreeLinkNode *root, TreeLinkNode *child, int flag) { if (child == NULL) return; if (flag == 0) { if (root->right != NULL) child->next = root->right; else { TreeLinkNode *temp = root->next; while (temp != NULL && temp->left == NULL && temp->right == NULL) { temp = temp->next; } if (temp == NULL) child->next = NULL; else if (temp->left != NULL) child->next = temp->left; else child->next = temp->right; } connect(child, child->right, 1); connect(child, child->left, 0); } else { if (root->next == NULL) child->next = NULL; else { TreeLinkNode *temp = root->next; while (temp != NULL && temp->left == NULL && temp->right == NULL) { temp = temp->next; } if (temp == NULL) child->next = NULL; else if (temp->left != NULL) child->next = temp->left; else child->next = temp->right; } connect(child, child->right, 1); connect(child, child->left, 0); } }};
0 0
- 【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
- [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 - 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]Populating Next Right Pointers in Each Node II
- 【LeetCode OJ】Populating Next Right Pointers in Each Node II
- [LeetCode] Populating Next Right Pointers in Each Node II
- Protobuf
- C++primer Plus答案3.14.9——3.14.10
- 安卓App有风险,爱加密加固保护App安全!
- C++ 拷贝构造函数与赋值函数
- 多线程启动时,局部变量与成员变量的差异
- [leetcode] Populating Next Right Pointers in Each Node II
- android游戏开发按锁屏键导致游戏重新加载问题
- C# 学习笔记(五) ++/--运算符重载的意义
- Android动画之translate(位移动画)
- Android 动画效果 --Animation 动画
- 内核初始化优化宏 ,初始化顺序, __init,__devexit等
- DSP/BIOS的点点滴滴
- EasyUI 动态tab页界面小结
- Makefile 管理工具 — Automake and Autoconf