Leetcode----minmum-depth-of-binary-tree
//minmum-depth-of-binary-tree
//递归深度优先
class Solution {
public:
int run(TreeNode *root) {
if(root == NULL)return 0;
int l = run(root->left);
int r = run(root->right)...
原创
2018-04-23 12:29:00 ·
206 阅读 ·
0 评论