Populating Next Right Pointers in Each Node II问题及解法
来源:互联网 发布:python 读取 csv 编辑:程序博客网 时间:2024/06/10 00:29
问题描述:
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.
示例:
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问题分析:
依次遍历每一层,根据parent节点寻找每个root节点的next值,迭代求解即可。
过程详见代码:
/** * 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) {TreeLinkNode parent(0);parent.left = root;bl(root, &parent,1);}void bl(TreeLinkNode *root, TreeLinkNode * parent,int dirt){if (root == NULL) return;TreeLinkNode * tp = parent;TreeLinkNode * tr = root; if (dirt == 1 && tp->right){tr->next = tp->right;tr = tr->next;}while (tp->next && tr->next == NULL){if (tp->next->left){tr->next = tp->next->left;tr = tr->next;}if (tp->next->right){tr->next = tp->next->right;tr = tr->next;}tp = tp->next;}bl(root->left, root,1);bl(root->right, root,2);}};
阅读全文
0 0
- Populating Next Right Pointers in Each Node问题及解法
- Populating Next Right Pointers in Each Node II问题及解法
- Populating Next Right Pointers in Each Node问题另一种解法
- 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
- php webservice实现客户端提交数据库数据到服务器并返回另一份数据库数据
- ZOJ 3949 树形DP
- Oracle性能优化-读懂执行计划
- 静态资源的解析(18)
- c#ftp操作全解:创建删除目录,上传下载文件,删除移动文件,文件改名,文件目录查询
- Populating Next Right Pointers in Each Node II问题及解法
- storm集群安装配置
- c#连接mysql数据库,增删查改命令执行
- 拦截器(19)
- 适用于各个版本的File转Uri,Uri转File
- 面试题---数值的整数次方
- OS学习笔记一
- iMX6开发板—SABER Lite评估板-imx.6评估板学习qnx
- 洛谷 小A点菜