leetcode: Minimum Depth of Binary Tree

来源:互联网 发布:淘宝苹果官网是真的吗 编辑:程序博客网 时间:2024/05/16 10:24

必须是到叶节点

/** * Definition for binary tree * struct TreeNode { *     int val; *     TreeNode *left; *     TreeNode *right; *     TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:    int minDepth(TreeNode *root) {        if( root == NULL)            return 0;        if( root->left && root->right)            return min( minDepth( root->left), minDepth( root->right)) + 1;        else if( root->left)            return minDepth( root->left) + 1;        else if( root->right)            return minDepth( root->right) + 1;        else            return 1;    }};


0 0
原创粉丝点击