1
# class TreeNode:
2
#     def __init__(self, val=0, left=None, right=None):
3
#         self.val = val
4
#         self.left = left
5
#         self.right = right
6
class Solution:
7
    def findSecondMinimumValue(self, root: Optional[TreeNode]) -> int:
8
        temp1=temp2=float(inf)
9
        from collections import deque
10
        a=deque([root])
11
        while a:
12
            node=a.popleft()
13
            if node.valtemp1:
14
                if node.val