zoukankan      html  css  js  c++  java
  • 671. Second Minimum Node In a Binary Tree 二叉树中第二小节点

    Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly twoor zero sub-node. If the node has two sub-nodes, then this node's value is the smaller value among its two sub-nodes.

    Given such a binary tree, you need to output the second minimum value in the set made of all the nodes' value in the whole tree.

    If no such second minimum value exists, output -1 instead.

    Example 1:

    Input: 
        2
       / 
      2   5
         / 
        5   7
    
    Output: 5
    Explanation: The smallest value is 2, the second smallest value is 5.
    

    Example 2:

    Input: 
        2
       / 
      2   2
    
    Output: -1
    Explanation: The smallest value is 2, but there isn't any second smallest value.
    

    给定由非负值的节点组成的非空特殊二叉树,其中该树中的每个节点都具有两个或零个子节点。如果节点有两个子节点,则该节点的值是其两个子节点之间的较小值。 给定这样一个二叉树,您需要输出整个树中所有节点值的集合中的第二个最小值。 如果不存在这样的第二个最小值,则输出-1。

    1. # Definition for a binary tree node.
    2. # class TreeNode(object):
    3. # def __init__(self, x):
    4. # self.val = x
    5. # self.left = None
    6. # self.right = None
    7. class Solution(object):
    8. def findSecondMinimumValue(self, root):
    9. """
    10. :type root: TreeNode
    11. :rtype: int
    12. """
    13. s = set()
    14. queue = [root]
    15. while queue and queue[0]:
    16. node = queue.pop(0)
    17. s.add(node.val)
    18. if node.left:
    19. queue.append(node.left)
    20. if node.right:
    21. queue.append(node.right)
    22. if len(s) < 2:
    23. return -1
    24. else:
    25. s.remove(min(s))
    26. return min(s)





  • 相关阅读:
    关于action的使用在firefox报错的问题
    用rspec执行自动化测试用例
    webdriver实现简单的窗口切换
    一个小测试总结
    在Notepad++下运行ruby代码
    webdriver入门之环境准备
    我也来谈谈小米——《参与感》观后感
    测试发展生涯的困惑
    小谈关于互联网产品的测试
    转:API 接口渗透测试
  • 原文地址:https://www.cnblogs.com/xiejunzhao/p/7501655.html
Copyright © 2011-2022 走看看