Efficiently design Insert, Delete and Median queries on a set - GeeksforGeeks

Efficiently design Insert, Delete and Median queries on a set - GeeksforGeeks
Given an empty set initially and a number of queries on it, each possibly of the following types:

1. Insert – Insert a new element 'x'.
2. Delete – Delete an existing element 'x'.
3. Median – Print the median element of the numbers currently in the set

2. The ‘Median’ query is made only when there are odd number of elements in the set.( We will need to make two queries on our segment tree, in case of even numbers )

Read full article from Efficiently design Insert, Delete and Median queries on a set - GeeksforGeeks