首页 > 代码库 > LeetCode Populating Next Right Pointers in Each Node
LeetCode Populating Next Right Pointers in Each Node
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
1 /** 2 * Definition for binary tree with next pointer. 3 * public class TreeLinkNode { 4 * int val; 5 * TreeLinkNode left, right, next; 6 * TreeLinkNode(int x) { val = x; } 7 * } 8 */ 9 public class Solution {10 public void connect(TreeLinkNode root) {11 if (root==null) {12 return;13 }14 TreeLinkNode father=null;15 root.next=null;16 doConnect(root, father);17 18 }19 20 private void doConnect(TreeLinkNode root,TreeLinkNode father){21 if (root == null) {22 return;23 }24 TreeLinkNode left=root.left;25 TreeLinkNode right=root.right; 26 if (root.left != null) {27 left.next=right;28 if (father !=null) {29 if ((father.next !=null) &&(father.next.left!=null)) {30 right.next=father.next.left;31 }32 33 }34 doConnect(left, left);35 doConnect(right, right); 36 37 }38 39 }40 }
LeetCode Populating Next Right Pointers in Each Node
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。