[LeetCode] Second Minimum Node In a Binary Tree

[LeetCode] Second Minimum Node In a Binary Tree

题目

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.

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.

代码

34 / 34 test cases passed.
Runtime: 0 ms

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
#define INF 0x7fffffff

// 找到节点node作为子树根的时候的最小值（不同于root->val的最小值）
int traverse(struct TreeNode* node, struct TreeNode* root) {
    int lval = INF;
    if (node->left != NULL) {
        lval = traverse(node->left, root);
    }
    int rval = INF;
    if (node->right != NULL) {
        rval = traverse(node->right, root);
    }   

    int val = INF;
    if (node->val != root->val) {
        val = node->val;
    } 

    if (lval != root->val) {
        if (val > lval) {
            val = lval;
        }
    }

    if (rval != root->val) {
        if (val > rval) {
            val = rval;
        }
    }
    return val;
}

int findSecondMinimumValue(struct TreeNode* root) {
    if (root == NULL) {
        return -1;
    }
    if (root->left == NULL && root->right == NULL) {
        return -1;
    }
    int val = INF;
    val = traverse(root, root);// val = INF 是因为没有跟root->val不同的值
    if (val == root->val || val == INF) {
        return -1;
    } else {
        return val;
    }
}