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)            return 0;        int HLtree=maxDepth(root->left);        int Hrtree=maxDepth(root->right);        return HLtree>Hrtree?HLtree+1:Hrtree+1;    }};