Treap is a balanced search tree that relies on a random distribution of keys to keep the tree balanced. This paper introduces a novel data structure that expands the concept of binary treap to N-ary trees. We outline the structural characteristics, including the parent-child relationship, and discuss the relative arrangement of elements with different priorities within this tree data structure. Furthermore, we analyze algorithms for performing operations such as searching, inserting, and deleting. Additionally, to evaluate the runtime of the operations mentioned above, we implemented the proposed data structure in C programming language and conducted several experiments. The proposed data structure achieves insertion and deletion operations in expected logarithmic time in average case. Furthermore, the suggested data structure is much simpler to implement than other n-ary trees like B-Trees [2]. This paper makes a valuable contribution to the field by offering a new approach to N-ary trees, which may be beneficial in the development of storage engines.