98. Validate Binary Search Tree

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isValidBST(TreeNode* root) {
       if(root)
       {
           if(root->right&&root->left)
           {
               if(!(root->left->val<root->val))
                    return false;
               if(!(root->right->val>root->val))
                    return false;
               return isValidBST(root->left)&&isValidBST(root->right);
           }
           else if(root->right&&!root->left)
           {
               if(!(root->val<root->right->val))
                    return false;
               return isValidBST(root->right);
           }
           else if(root->left&&!root->right)
           {
               if(!(root->left->val<root->val))
                    return false;
               return isValidBST(root->left);
           }
           else 
           {
               return true;
           }
       }
       else 
       {
           return true;
       }
    }
};