[leetcode]Maximum Depth of Binary Tree

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.

解题思路 ： 后续遍历二叉树的应用

/** * 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 maxDepth(TreeNode *root) {        // Note: The Solution object is instantiated only once and is reused by each test case.        if(root == NULL) return 0;        int lh = maxDepth(root->left);        int rh = maxDepth(root->right);                int h;        h = lh > rh ? lh + 1 : rh + 1;        return h;    }};