104. Maximum Depth of Binary Tree [LeetCode]

/**************************************************************************
 * 
 * 104. [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)
 * 
 * Given the root of a binary tree, return its maximum depth. 
 * A binary tree's maximum depth is the number of nodes along the longest path 
 * from the root node down to the farthest leaf node.
 * 
 **************************************************************************/


int maxDepth(struct TreeNode* root){
    if (NULL == root) return 0;
    return 1 + fmax(maxDepth(root->left), maxDepth(root->right));
}