# Validate Binary Search Tree Blind 75 LeetCode Question

## Too Long; Didn't Read

BST is defined as follows: left subtree of a node contains only nodes with keys **less than** the node’s key. Right subtree contains only node with keys**greater than the key. Both the left and right subtrees must also be binary search trees. We have to verify if given binary tree is valid BST.