Validate BST from Level Order

A binary tree is given in level order with -1 for a missing child (children of missing nodes are not listed). Print YES if it is a valid BST with strictly ordered keys, else NO.

1 <= n <= 10^5