104. Maximum Depth of Binary Tree(最大树深度)

 

---

 

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

 

 

class Solution {
public:
    int maxDepth(TreeNode* root) {
        if(root == nullptr) return 0;
        if (root->left != nullptr && root->right != nullptr) {
            return 1 + max(maxDepth(root->left), maxDepth(root->right));
        } else if (root->left != nullptr && root->right == nullptr) {
            return 1 + maxDepth(root->left);
        } else if (root->left == nullptr && root->right != nullptr) {
            return 1 + maxDepth(root->right);
        } 
        return 1;
    }
};