首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >Second Minimum Node In a Binary Tree

Second Minimum Node In a Binary Tree

作者头像
Tyan
发布2019-05-25 22:40:20
2970
发布2019-05-25 22:40:20
举报
文章被收录于专栏:SnailTyanSnailTyan

1. Description

Second Minimum Node In a Binary Tree
Second Minimum Node In a Binary Tree

2. Solution

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int findSecondMinimumValue(TreeNode* root) {
        int minimum = INT_MAX;
        int secondMinimum = -1;
        dfs(root, minimum, secondMinimum);
        if(secondMinimum == minimum) {
            return -1;
        }
        return secondMinimum;
    }
    
private:
    void dfs(TreeNode* root, int& minimum, int& secondMinimum) {
        if(!root) {
            return;
        }
        if(root->val < minimum) {
            minimum = root->val;
            secondMinimum = minimum;
        }
        if(root->val > minimum && (secondMinimum == minimum || root->val < secondMinimum)) {
            secondMinimum = root->val;
        }
        dfs(root->left, minimum, secondMinimum);
        dfs(root->right, minimum, secondMinimum);
    }
};

本文参与 腾讯云自媒体分享计划,分享自作者个人站点/博客。
原始发表:2018年12月11日,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体分享计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • 1. Description
  • 2. Solution
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档