0117-populating-next-right-pointers-in-each-node-ii¶
Try it on leetcode
Description¶
Given a binary tree
struct Node {
int val;
Node *left;
Node *right;
Node *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.
Example 1:
Input: root = [1,2,3,4,5,null,7] Output: [1,#,2,3,#,4,5,7,#] Explanation: Given the above binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B. The serialized output is in level order as connected by the next pointers, with '#' signifying the end of each level.
Example 2:
Input: root = [] Output: []
Constraints:
- The number of nodes in the tree is in the range
[0, 6000]. -100 <= Node.val <= 100
Follow-up:
- You may only use constant extra space.
- The recursive approach is fine. You may assume implicit stack space does not count as extra space for this problem.
Solution(Python)¶
"""
# Definition for a Node.
# class Node:
# def __init__(self, val: int = 0, left: 'Node' = None, right: 'Node' = None, next: 'Node' = None):
# self.val = val
# self.left = left
# self.right = right
# self.next = next
# """
from collections import deque
class Solution:
def connect(self, root: 'Node') -> 'Node':
# deque
# keep list of node
# node
# set next of all nodes in the list
# 1 level_list = [] iterate left and right
# [2,3] 2 -> 3
# append to queue [2,3]
# levl_list 4 5 7
# append_to_qie
if not root:
return None
cur = root
while cur:
dummy = Node(0)
tail = dummy
while cur:
if cur.left:
tail.next = cur.left
tail = tail.next
if cur.right:
tail.next = cur.right
tail = tail.next
# Move to the next node in the current level
cur = cur.next
cur = dummy.next
return root