Facebook | Phone Screen | Cartesian tree

Given an integer array, create a tree with following properties: a. Binary tree b. Min tree (heap) c. In order traversal return original array. For eg: 1. [1, 2, 3, 5] Output: 1 \\ 2 \\ 3 \\ 5 2. [5,...