Given an array in Pre-Order(root, left, right) traversal order, I need to construct a binary tree, not a binary search tree, just a binary tree where each root can have 0, 1
