Leetcode671. 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.

题目分析:

这是一棵树,首先考虑递归。然后要找到第二小的结点。

所以用一个min1, min2的结点去标记。


代码:

class Solution {
public:
    int min1 = INT32_MAX, min2 = INT32_MAX;
    int findSecondMinimumValue(TreeNode* root) {
        inorder(root);
        return min2 == INT32_MAX?-1:min2;
    }
    void inorder(TreeNode* root) {
        if (!root) return;
        if (root->val < min1) {
            min2 = min1;
            min1 = root->val;
        } else if (root->val > min1 && root->val < min2) {
            min2 = root->val;
        }
        inorder(root->left);
        inorder(root->right);
    }
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值