[leetcode] 116. Populating Next Right Pointers in Each Node @ python

原题

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.
Recursive approach is fine, implicit stack space does not count as extra space for this problem.
You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
Example:

Given the following perfect binary tree,

/
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

BFS, 按层遍历, 将每层的节点加到q, 然后对q遍历, 将每个节点指向下一个节点, 最后一个节点指向None.
Time: O(n)
Space: O(1)

代码

# Definition for binary tree with next pointer.
# class TreeLinkNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#         self.next = Noneclass Solution:# @param root, a tree link node# @return nothingdef connect(self, root):if not root:returnq = [root]while q:for i in range(1, len(q)):q[i-1].next = q[i]q[-1].next = Nonenew_q = []for node in q:if node.left:new_q.append(node.left)if node.right:new_q.append(node.right)q = new_q

解法2

BFS, 简化版

代码

"""
# Definition for a Node.
class Node(object):def __init__(self, val, left, right, next):self.val = valself.left = leftself.right = rightself.next = next
"""
class Solution(object):def connect(self, root):""":type root: Node:rtype: Node"""# base caseif not root: return Noneq = [root]while q:for i in range(1, len(q)):q[i-1].next = q[i]q = [kid for node in q for kid in (node.left, node.right) if kid]return root

解法3

DFS

代码

"""
# Definition for a Node.
class Node(object):def __init__(self, val, left, right, next):self.val = valself.left = leftself.right = rightself.next = next
"""
class Solution(object):def connect(self, root):""":type root: Node:rtype: Node"""# base caseif not root: returnif root.right:root.left.next = root.rightif root.next:root.right.next = root.next.leftself.connect(root.left)self.connect(root.right)return root

[leetcode] 116. Populating Next Right Pointers in Each Node @ python相关推荐

LeetCode 116. Populating Next Right Pointers in Each Node
LeetCode 116. Populating Next Right Pointers in Each Node Solution1:我的答案迭代版层次遍历有个2B bug困扰了我好久 clas ...
【To Understand!】LeetCode 117. Populating Next Right Pointers in Each Node II
LeetCode 117. Populating Next Right Pointers in Each Node II Solution1:我的答案层次遍历 /*** Definition for ...
Leetcode 笔记 116 - Populating Next Right Pointers in Each Node
题目链接:Populating Next Right Pointers in Each Node | LeetCode OJ Given a binary tree struct TreeLinkNo ...
LeetCode 117. Populating Next Right Pointers in Each Node II
原题链接在这里:https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/ 题目: Given a bi ...
[Leetcode Week15]Populating Next Right Pointers in Each Node
Populating Next Right Pointers in Each Node 题解原创文章,拒绝转载题目来源:https://leetcode.com/problems/populati ...
LeetCode OJ - Populating Next Right Pointers in Each Node II
题目: Follow up for problem "Populating Next Right Pointers in Each Node". What if the given ...
[Leetcode][JAVA] Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tre ...
116. Populating Next Right Pointers in Each Node
题目: Given a binary tree struct TreeLinkNode {TreeLinkNode *left;TreeLinkNode *right;TreeLinkNode *ne ...
Leetcode: Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree ...

[leetcode] 116. Populating Next Right Pointers in Each Node @ python

原题

解法1

代码

解法2

代码

解法3

代码

[leetcode] 116. Populating Next Right Pointers in Each Node @ python相关推荐

最新文章

热门文章