[LeetCode] Populating Next RIght Pointer in Each Node II
来源:互联网 发布:js array indexof ie8 编辑:程序博客网 时间:2024/05/12 11:43
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
Key: consider the case when the next pointer has no child. Must find the following next pointers until one has a child. Populate from the right.
/** * 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) { // Note: The Solution object is instantiated only once and is reused by each test case. if(root==NULL || (root->left==NULL && root->right==NULL)) return; if(root->left!=NULL && root->right!=NULL) root->left->next=root->right; TreeLinkNode *rootLastChild; if(root->right!=NULL) rootLastChild=root->right; else rootLastChild=root->left; TreeLinkNode *nextChild=NULL; TreeLinkNode *rootNext=root->next; while(rootNext!=NULL) { if(rootNext->left!=NULL) nextChild=rootNext->left; else if(rootNext->right!=NULL) nextChild=rootNext->right; if(nextChild != NULL) break; rootNext=rootNext->next; } if(nextChild != NULL) { rootLastChild->next=nextChild; } connect(root->right); connect(root->left); }};
- LeetCode: Populating Next Right Pointer in Each Node II
- [LeetCode] Populating Next RIght Pointer in Each Node II
- Leetcode: Populating Next Right Pointer in Each Node
- 【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
- request.getRequestDispatcher().forward(request,response)和response.sendRedirect()的区别
- Path Sum II 二叉树路径和,打印所有路径 @LeetCode
- 『设计』Slithice 分布式架构设计-支持一体式开发,分布式发布
- Linux下配置DNS
- 在Ubuntu 12.04上安装GNOME实现XRDP远程桌面访问ubuntu
- [LeetCode] Populating Next RIght Pointer in Each Node II
- ImageUtils工具演示
- C语言运算符优先级
- 灯光上网"技术江苏已实现 仍难取代无线宽带
- 递归,回溯,DFS,BFS的理解和模板
- 递归转非递归理解
- Tor 介绍
- How to use JPA from a JBoss Web application ?(jboss 中如何使用线程安全的EntityManagerFactory )
- MillionDollarHomePage.com:100万美元的网页