Arvind Raj T

Add Interval Tree

5

#### Description of the problem In computer science, an interval tree is a tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap...

Implement Radix sort

7

#### Description of the problem Radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according to their radix. #### Example of the...

Implement Parallel Timsort

4

#### Description of the problem Timsort is a hybrid stable sorting algorithm, derived from merge sort and insertion sort, designed to perform well on many kinds of real-world data. It...

Adding suffix tree

39

#### Suffix Tree #### References to other Issues or PRs or Relevant literature "Fixes #290". See https://github.com/codezonediitj/pydatastructs/issues/290 #### Brief description of what is fixed or changed Addition of suffix tree...

Add Parent pointer tree

3

#### Description of the problem In computer science, an in-tree or parent pointer tree is an N-ary tree data structure in which each node has a pointer to its parent...

Longest Alternating Subsequence

4

### Description of the problem Longest Alternating Subsequence is a problem of finding a subsequence of a given sequence in which the elements are in alternating order, and in which...