Validate Binary Search Tree

Given a binary tree in level-order form, determine whether it is a valid BST: for every node, all values in the left subtree are strictly smaller and all values in the right subtree are strictly greater.

1 <= number of nodes <= 10^4 -2^31 <= value <= 2^31 - 1