Problem Description:
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 Solution:
1 public void connect(TreeLinkNode root) { 2 if (root == null) return; 3 4 TreeLinkNode left = root; 5 while (left != null && left.left != null && left.right != null) { 6 root = left; 7 while (root != null) { 8 root.left.next = root.right; 9 if (root.next != null) { 10 root.right.next = root.next.left; 11 } 12 root = root.next; 13 } 14 15 left = left.left; 16 } 17 }
Problem Populating Next Right Pointers in Each Node
时间: 2024-10-13 12:24:28