116. Populating Next Right Pointers in Each Node
来源:互联网 发布:centos没有桌面文件夹 编辑:程序博客网 时间:2024/05/17 08:30
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
Subscribe to see which companies asked this question.
/** * 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;root.next = null;while (root.left != null) {TreeLinkNode nexthead = root.left;while (root != null) {root.left.next = root.right;if (root.next != null)root.right.next = root.next.left;elseroot.right.next = null;root = root.next;}root = nexthead;}return; }}
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
- HDU2732 最大流..
- 方立勋_30天掌握JavaWeb_div和css基础
- android中电源管理
- Vim插件之vim-autoformat
- hbm2ddl.auto:生成表结构的策略配置
- 116. Populating Next Right Pointers in Each Node
- Eclipse开发struts完全指南
- JAVA多线程之——ArrayBlockingQueue
- 1034. 有理数四则运算(20)
- Maven的安装及配置
- 遍历器异常: java.util.NoSuchElementException
- hibernate 三种状态
- Tensorflow计算模型 —— 计算图
- react 指令封装