zoukankan      html  css  js  c++  java
  • 623. Add One Row to Tree 将一行添加到树中

    Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node is at depth 1.

    The adding rule is: given a positive integer depth d, for each NOT null tree nodes N in depth d-1, create two tree nodes with value v as N's left subtree root and right subtree root. And N's original left subtree should be the left subtree of the new left subtree root, its original right subtree should be the right subtree of the new right subtree root. If depth d is 1 that means there is no depth d-1 at all, then create a tree node with value v as the new root of the whole original tree, and the original tree is the new root's left subtree.

    Example 1:

    Input: 
    A binary tree as following:
           4
         /   
        2     6
       /    / 
      3   1 5   
    
    v = 1d = 2Output: 
           4
          / 
         1   1
        /     
       2       6
      /      / 
     3   1   5   
    
    

    Example 2:

    Input: 
    A binary tree as following:
          4
         /   
        2    
       /    
      3   1    
    
    v = 1d = 3Output: 
          4
         /   
        2
       /     
      1   1
     /       
    3       1
    

    Note:

    1. The given d is in range [1, maximum depth of the given tree + 1].
    2. The given binary tree has at least one tree node.

    1. class Solution:
    2. def addOneRow(self, root, v, d):
    3. """
    4. :type root: TreeNode
    5. :type v: int
    6. :type d: int
    7. :rtype: TreeNode
    8. """
    9. if d is 1:
    10. newRoot = TreeNode(v)
    11. newRoot.left = root
    12. return newRoot
    13. queue = [root]
    14. while queue and d > 2:
    15. d -= 1
    16. count = len(queue)
    17. for i in range(count):
    18. node = queue.pop(0)
    19. if node.left:
    20. queue.append(node.left)
    21. if node.right:
    22. queue.append(node.right)
    23. for curNode in queue:
    24. temp = curNode.left
    25. curNode.left = TreeNode(v)
    26. curNode.left.left = temp
    27. temp = curNode.right
    28. curNode.right = TreeNode(v)
    29. curNode.right.right = temp
    30. return root







  • 相关阅读:
    vue-nuxtjs
    mongodb4.0支持事务
    promisify,promisifyAll,promise.all实现原理
    nodejs, 阿里oss上传下载图片
    数据库备份与还原
    SQL 数据类型、约束、索引及视图
    数据库的查询
    数据库(增、删、改、查)
    数据库基础知识
    C#语言小结
  • 原文地址:https://www.cnblogs.com/xiejunzhao/p/8401763.html
Copyright © 2011-2022 走看看