Return true if a binary tree is a valid binary search tree : every node in a left subtree is strictly less than the node, every node in a right subtree strictly greater, and both subtrees are themselves valid BSTs. Input format Level-order JSON array with nulls, e.g. [[2,1,3]] . TreeNode is predefined.