LeetCode——Maximum Depth of Binary Tree

LeetCode——Maximum Depth of Binary Tree

Question

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.

Answer

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

class Solution {
public:
	// 求树的高度
    int maxDepth(TreeNode* root) {
        if (!root)
            return 0;
        else {
            int i = maxDepth(root->left);
            int j = maxDepth(root->right);
            return max(i, j) + 1;
        }
    }
};