Min Treap on top of a Segment tree

As we know treap is the combination of Tree and Heap. It is a tree like structure that has a **rigid order** when traversed. This helps us to query with both the value and the index in that sequence. With help of Segment Tree, we can get these query done in log N time. The full implementation is here in this project