zoukankan      html  css  js  c++  java
  • LeetCode 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 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.

    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.
    
    /**
     * 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 { //利用set来过滤掉重复的数,先序遍历来将所有的节点数值收入set中
    public:
        void pre_order(TreeNode* root, set<int> &porder){
            if(root)
                porder.insert(root->val);
            else
                return ;
            pre_order(root->left, porder);
            pre_order(root->right, porder);
        }
        int findSecondMinimumValue(TreeNode* root) {
            set<int> porder;
            pre_order(root, porder);
            if(porder.size()<2)
                return -1;
            else
                return *(++porder.begin());
        }
    };
    
  • 相关阅读:
    开通第一天,以此随笔作为纪念
    Apache 基于IP访问网站
    命令解释
    vi总结
    RAID
    Windows虚拟机安装
    CentOS虚拟机安装
    通过挂载系统光盘搭建本地yum仓库的方法
    VMware workstation 的安装
    Linux下关于vi命令的详细解说
  • 原文地址:https://www.cnblogs.com/A-Little-Nut/p/10080012.html
Copyright © 2011-2022 走看看