二叉树 最大最小深度

class Solution {public:    /**     * @param root: The root of binary tree.     * @return: An integer     */     int maxx=0;     void look(TreeNode *root,int i)     {         if(root==NULL)         return ;         i++;         if(root->left==NULL&&root->right==NULL&&i>maxx)         {             maxx=i;         }         look(root->left,i);         look(root->right,i);     }    int maxDepth(TreeNode *root) {        int i=0;        look(root,i);        return maxx;        // write your code here    }};

最大深度

class Solution {public:    /**     * @param root: The root of binary tree.     * @return: An integer     */     int maxx=9999999;      void look(TreeNode *root,int i)     {         if(root==NULL)         return ;         i++;         if(root->left==NULL&&root->right==NULL&&i<maxx)         {             maxx=i;         }         look(root->left,i);         look(root->right,i);     }    int minDepth(TreeNode *root) {        int i=0;        if(root==NULL)        return 0;        look(root,i);        return maxx;        // write your code here    }};

最小深度