MAXIMUM DEPTH OF BINARY TREE.cpp

class Solution
{
public:
     int maxDepth(TreeNode *root)
     {

          if (root == NULL)
               return 0;

          int leftAns = maxDepth(root->left);
          int rightAns = maxDepth(root->right);

          return max(leftAns, rightAns) + 1;
     }
};

// LEETCODE PROBLEM -104