[LeetCode]Populating Next Right Pointers in Each Node
来源:互联网 发布:kiki队长网络红人主播 编辑:程序博客网 时间:2024/06/06 21:13
Given a binary tree
struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL
.
Initially, all next pointers are set to NULL
.
Note:
- You may only use constant extra space.
- You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
For example,
Given the following perfect binary tree,
1 / \ 2 3 / \ / \ 4 5 6 7
After calling your function, the tree should look like:
1 -> NULL / \ 2 -> 3 -> NULL / \ / \ 4->5->6->7 -> NULL
广搜+递归
递归两次
connectLR()后的树如图
1 -> NULL / \ 2 3 -> NULL / \ / \ 4->5 6->7 -> NULLconnectRL()用于连接右子树到左子树 运行时间:436ms
/** * Definition for binary tree with next pointer. * public class TreeLinkNode { * int val; * TreeLinkNode left, right, next; * TreeLinkNode(int x) { val = x; } * } */public class Solution {public void connect(TreeLinkNode root) {if(root == null) return;connectLR(root);connectRL(root);}private void connectLR(TreeLinkNode root){if(root.left==null) return;root.left.next = root.right;connectLR(root.left);connectLR(root.right);}private void connectRL(TreeLinkNode root){if(root.left==null) return;if(root.next!=null){root.right.next = root.next.left;}connectRL(root.left);connectRL(root.right);}}
一次递归完成 运行时间:440ms
/** * Definition for binary tree with next pointer. * public class TreeLinkNode { * int val; * TreeLinkNode left, right, next; * TreeLinkNode(int x) { val = x; } * } */public class Solution {public void connect(TreeLinkNode root) {connect(root,null);}private void connect(TreeLinkNode root, TreeLinkNode brother){if(root == null) return;root.next = brother;connect(root.left,root.right);if(brother!=null){connect(root.right,brother.left);}else{connect(root.right,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 &&Populating Next Right Pointers in Each Node||
- LeetCode Populating Next Right Pointers in Each Node & Populating Next Right Pointers in Each Node I
- 【Leetcode】Populating Next Right Pointers in Each Node in JAVA
- LeetCode Populating Next Right Pointers in Each Node
- LeetCode Populating Next Right Pointers in Each Node II
- [Leetcode] Populating Next Right Pointers in Each Node
- LeetCode: Populating Next Right Pointers in Each Node
- [Leetcode] Populating Next Right Pointers in Each Node II
- [LeetCode] Populating Next Right Pointers in Each Node
- [LeetCode] Populating Next Right Pointers in Each Node II
- 【leetcode】 Populating Next Right Pointers in Each Node
- leetcode 78: Populating Next Right Pointers in Each Node
- leetcode 79: Populating Next Right Pointers in Each Node II
- Leetcode: Populating Next Right Pointers in Each Node
- [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
- WTL工程设置:在X64环境中找不到atlres.h和atlapp.h
- windows下安装zookeeper
- EditText输入密码的显示与隐藏
- arcgis for js开发,根据给定的经纬度在地图上进行标注
- Array[1] n sum 问题
- [LeetCode]Populating Next Right Pointers in Each Node
- linux0.11 编译遇到的问题
- 【LeetCode】Rotate List
- 无名师的Unix心传
- 恶意 Android应用程序攻击RFID 支付卡
- R 语言 RFM 模型实现
- 签名和重载(overload) 重写(override)
- ps做出阴影
- 泛型持久层实现(深度减轻代码量)