首页 > 代码库 > Leetcode_num10_Populating Next Right Pointers in Each Node
Leetcode_num10_Populating Next Right Pointers in Each Node
题目:
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
.
- 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).
先横向遍历该层的节点,若为左子树节点则指向右子树节点,右节点需在上层节点next指向不为空的情况指向下一个节点的左子树节点(内循环)
再以下一层第一个左节点为起点遍历(外循环)
</pre><pre name="code" class="python">class Solution: # @param root, a tree node # @return nothing def connect(self, root): if(root): pre=root cur=TreeNode(0) while(pre.left): cur=pre while(cur): cur.left.next=cur.right if(cur.next): cur.right.next=cur.next.left cur=cur.next pre=pre.left
Leetcode_num10_Populating Next Right Pointers in Each Node
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。