give root binary tree determine valid binary search tree bsta valid BST define followsthe leave subtree node contain node key node keythe right subtree node contain nod key great node keyBoth leave right subtree binary search tree Example 1input root 213output trueExample 2input root 514nullnull36Output falseexplanation the root node value 5 right child value 4 ConstraintsThe number nod tree range 1 104231 Nodeval 231 1