**Pr-requisites : **Basics of treap(covered in part1). Interval trees (like segment tree or fenwick tree).

Continue reading “Treaps : One Tree to Rule ’em all ..!! Part-2”

Skip to content
# Category: Data Structures

# Treaps : One Tree to Rule ’em all ..!! Part-2

# Treaps : One Tree to Rule ’em all ..!! Part-1

**Pr-requisites : **Basics of treap(covered in part1). Interval trees (like segment tree or fenwick tree).

Continue reading “Treaps : One Tree to Rule ’em all ..!! Part-2”

**Introduction : **Well, don’t get too much carried away by the title of the blog. By the end of this article you shall realize the motivation behind it. ðŸ™‚

So, let’s begin :

**Pre-requisites : **Binary Search Tree and Binary Heap.

Continue reading “Treaps : One Tree to Rule ’em all ..!! Part-1”