zoukankan      html  css  js  c++  java
  • 116.Populating Next Right Pointers in Each Node

    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,

         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
    
    # Definition for binary tree with next pointer.
    class TreeLinkNode:
        def __init__(self, x):
            self.val = x
            self.left = None
            self.right = None
            self.next = None
    
    class Solution:
        # @param root, a tree link node
        # @return nothing
        def connect(self, root):
            if root is None:
                return
            level = []
            level.append(root)
            while len(level):
                l = len(level)
                for i in range(l-1):
                    node = level.pop(0) # There is no need to create another list to save level,just populate in place.
                    node.next = level[0]
                    if node.left:
                        level.append(node.left)
                        level.append(node.right)
                node = level.pop(0)
                if node.left:
                    level.append(node.left)
                    level.append(node.right)
            return
    
  • 相关阅读:
    二维数组实现01背包
    一维数组实现01背包
    js实现最长子串算法
    mysql__存储过程
    mysql 分页查询 limit
    转:严重: Exception loading sessions from persistent storage
    struts2---ValueStack对象
    struts2----ognl
    什么是JavaBean?
    EL表达式
  • 原文地址:https://www.cnblogs.com/bernieloveslife/p/9762030.html
Copyright © 2011-2022 走看看