LeetCode 671. Second Minimum Node In a Binary Tree

Description

https://leetcode.com/problems/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 two or zero sub-node. If the node has two sub-nodes, then this node’s value is the smaller value among its two sub-nodes. More formally, the property root.val = min(root.left.val, root.right.val) always holds.

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: root = [2,2,5,null,null,5,7]
Output: 5
Explanation: The smallest value is 2, the second smallest value is 5.

Example 2:

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

Constraints:

• The number of nodes in the tree is in the range [1, 25].
• 1 <= Node.val <= 231 - 1
• root.val == min(root.left.val, root.right.val) for each internal node of the tree.

Explanation

Traverse the tree to get node values. And sort the nodes values to find the second minimum value.

Python Solution

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def findSecondMinimumValue(self, root: TreeNode) -> int:
        self.values = []
        
        self.traverse(root)
        
        
        self.results = []
        
        self.values = set(self.values)
        if len(self.values) > 1:
            for v in self.values:
                heapq.heappush(self.results, v)
            
            heapq.heappop(self.results)
            return heapq.heappop(self.results)
        else:
            return -1
        
    def traverse(self, root):
        if not root:
            return
        
        self.values.append(root.val)
        self.traverse(root.left)
        self.traverse(root.right)