[LeetCode] Populating Next Right Pointers in Each Node II
来源:互联网 发布:hbuilder for mac下载 编辑:程序博客网 时间:2024/04/27 10:24
Populating Next Right Pointers in Each Node II
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
解题思路:
与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) { if(root==NULL){ return; } TreeLinkNode* upLayerFirstNode = root; TreeLinkNode* upLayerNode = root; TreeLinkNode* node = root->left==NULL ? root->right : root->left; while(node!=NULL){ bool findUpLayerFirstNode = false; while(upLayerNode!=NULL){ if(!findUpLayerFirstNode && (node->left!=NULL || node->right!=NULL)){ upLayerFirstNode = node; findUpLayerFirstNode = true; } if(upLayerNode->left == node){ //当前节点为上层节点的左孩子节点 if(upLayerNode->right!=NULL){ node->next = upLayerNode->right; node = node->next; upLayerNode = upLayerNode->next; }else{ upLayerNode = upLayerNode->next; } }else if(upLayerNode->right == node){ //当前节点为上层节点的右孩子节点 upLayerNode = upLayerNode->next; }else if(upLayerNode->left!=NULL){ //当前节点均不是上层节点的左右孩子节点,且上层节点存在左孩子节点 node->next = upLayerNode->left; node = node->next; }else if(upLayerNode->right!=NULL){ //上层节点不存在左孩子节点,但存在右孩子节点,且右孩子节点不是当前节点 node->next = upLayerNode->right; node = node->next; upLayerNode = upLayerNode->next; }else{ //上层节点不存在孩子节点 upLayerNode = upLayerNode->next; } if(!findUpLayerFirstNode && (node->left!=NULL || node->right!=NULL)){ //注意这里还需要判断一下,因为当期节点有可能next操作了 upLayerFirstNode = node; findUpLayerFirstNode = true; } } if(findUpLayerFirstNode){ upLayerNode=upLayerFirstNode; node = upLayerFirstNode->left==NULL ? upLayerFirstNode->right : upLayerFirstNode->left; }else{ node = NULL; } } }};
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
- Burp suite的安装教程
- 架构师应该掌握什么技术?
- selenim java判断图片有没有加载完成
- 华为OJ(名字漂亮度)
- 关于android中broadcast和BroadcastReceiver浅谈
- [LeetCode] Populating Next Right Pointers in Each Node II
- Linux之debugfs介绍
- POJ 2528 Mayor's posters (线段树+离散化)
- ADNROID XML图像资源文件详细讲解(五)
- bzoj 1199 二分暴力
- 将 res 资源文件转换成 file
- C/C++语言 void 及 void 指针深层探索
- ftp上传图片的简单用法
- aapt简介及常用命令