text: //
  //  maximum-depth-of-binary-tree.h
  //
  //  Created by jeswang 27/06/2014.
  //
  
  /*
  Description:
  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) {
          
      }
  };