Populating Next Right Pointers in Each Node
1. Title
Populating Next Right Pointers in Each Node
2. Http address
https://leetcode.com/problems/populating-next-right-pointers-in-each-node/
3. The question
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
4. My code (AC)
1 // accepted 2 public void conctTwo(TreeLinkNode root) { 3 if( root == null) 4 return; 5 6 //root.left = root.right; 7 if( root.left != null) 8 { 9 root.left.next = root.right; 10 11 if( root.next == null) 12 { 13 root.right.next = null; 14 }else{ 15 root.right.next = root.next.left; 16 } 17 18 conctTwo(root.left); 19 conctTwo(root.right); 20 } 21 22 23 }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步