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.
每个节点的值为他两个子节点的较小值，求整棵树第二小的数
C++（3ms）：
1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), left(NULL), right(NULL) {} 8 * }; 9 */ 10 class Solution { 11 public: 12 int findSecondMinimumValue(TreeNode* root) { 13 if(!root) 14 return -1 ; 15 int res = minval(root , root->val) ; 16 return res ; 17 } 18 19 int minval(TreeNode* root , int firstVal){ 20 if (root == NULL) 21 return -1 ; 22 if (root->val != firstVal) 23 return root->val ; 24 int left = minval(root->left , firstVal) ; 25 int right = minval(root->right , firstVal) ; 26 if (left == -1) 27 return right ; 28 if (right == -1) 29 return left ; 30 return min(left,right) ; 31 } 32 };
