Populating Next Right Pointers in Each Node
来源:互联网 发布:推荐个淘宝日本代购店 编辑:程序博客网 时间:2024/05/14 10:25
Populating Next Right Pointers in Each Node
Total Accepted: 5874 Total Submissions: 17154My Submissions
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
preorder traversal, 也可以用BFS
public static void connect(TreeLinkNode root){ if(root == null) return; if(root.left!=null) root.left.next = root.right; if(root.right!=null && root.next!=null) root.right.next= root.next.left; connect(root.left); connect(root.right); }// BFSpublic static void connect(TreeLinkNode root) { if(root == null) return; TreeLinkNode head = root; while(head!=null){ TreeLinkNode subList = new TreeLinkNode(0); TreeLinkNode temp = subList; while(head!=null){ if(head.left!=null) { temp.next = head.left; temp = temp.next; } if(head.right!=null) { temp.next = head.right; temp = temp.next; } head = head.next; } head = subList.next; }}
0 0
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Microsoft NLayerApp案例理论与实践【基础结构层Cross-Cutting部分】
- Microsoft NLayerApp案例理论与实践【基础结构层数据访问部分】
- 算法导论 5.3-6
- 意外结缘 日久生情
- Microsoft NLayerApp案例理论与实践【领域模型层】
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node II
- 酷派公司怎么样?酷派员工真可怜,春节请年假罚款一万!
- CSS入门之其他伪类,first-child,left,right,lang,focus
- sd卡的自动挂载
- u盘自动挂载-udev(转载加修改)
- u盘自动挂载
- Linux下实现U盘、SD卡自动挂载功能
- linux嵌入式系统下实现U盘、SD卡自动挂载功能