树的高度

  int deep(TreeNode pRoot)
    {
        if(pRoot==null)
            return 0;
        int left=deep(pRoot.left);
        int right=deep(pRoot.right);
        
        return (left>right)?left+1:right+1;
    }