Maximum Depth of Binary Tree - LeetCode

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 GetDepth(TreeNode * node)
{
	if (node->left == NULL && node->right == NULL)
	{
		return 1;
	}
	int ldepth = 0,rdepth = 0;
	if (node->left != NULL)
	{
		ldepth = GetDepth(node->left);
	}
	if (node->right != NULL)
	{
		rdepth = GetDepth(node->right);
	}

	return ldepth > rdepth?ldepth+1:rdepth+1;
}
int maxDepth(TreeNode *root) {
	if (root == NULL)
	{
		return 0;
	}
	int ldepth = 1,rdepth = 1;
	if (root->left != NULL)
		ldepth = GetDepth(root->left) + 1;
	if (root->right != NULL)
		rdepth = GetDepth(root->right) + 1;
	return ldepth > rdepth?ldepth:rdepth;
}
};