Create Convert Sorted Array to Binary Search Tree.cpp

Do not use recursion
Basic Idea: use a structure to remember the lower/upper bound, as well as node pointer of last iteration, use a queue to queue that structure for next iteration.