Request for Implementation for Additional Data Structure

[Tinny-Robot]

Issue Description

We're looking to enhance the functionality of PyDS-A by implementing various data structures. This wills

Proposed Data Structures

Please keep in mind that the proper way to link an issue to this list is to comment:

Linear Data Structures:

Arrays:

• Implementation of arrays with efficient indexing.

Linked List:

• Singly Linked List #33

• Implementation of a doubly linked list.

• Implementation of a circular linked list.

• Priority Queue
  Implementation of a priority queue with associated priorities.

• Deque (Double-ended Queue)
  Implementation of a deque that allows elements to be added or removed from both ends.

Tree Data Structures:

• Tree
  Implementation of a general tree data structure.

• Binary Tree #34
  Implementation of a binary tree with support for at most two children per node.

• Binary Search Tree (BST)
  Implementation of a binary search tree with left subtree values < node value < right subtree values.

• Heap #36
  Implementation of a binary heap data structure.

Graph Data Structures:

Graph:

• Graph #40
  Implementation of a graph data structure with nodes and edges.

Trie:

• Implementation of a trie data structure for storing strings efficiently.

Self-Balancing Trees:

Red-Black Tree:

• Implementation of a red-black tree for balanced binary search operations.

AVL Tree:

• Implementation of an AVL tree for strict balancing.

Spatial Data Structures:

Quadtree:

• Implementation of a quadtree for spatial indexing in 2D space.

Octree:

• Implementation of an octree for spatial indexing in 3D space.

Other Data Structures:

Bloom Filter:

• Implementation of a Bloom filter for probabilistic membership testing.

Skip List:

• Implementation of a skip list for efficient search, insertion, and deletion in a sorted sequence. #41

Sparse Matrix:

• Implementation of a sparse matrix for efficient representation of matrices with many zero elements.

Segment Tree:

• Implementation of a segment tree for various range-query tasks, such as summing elements in a range.

Suffix Tree:

• Implementation of a suffix tree for string matching and search operations.

Suffix Array:

• Suffix Array #51
  Implementation of a suffix array for pattern matching and text indexing.

The main file paths where these data structures are likely to be added are:

pyds_a/data_structures/

Please keep in mind that the proper way to link an issue to this list is to comment:

- [ ] #issue_number

where #issue_number refers to the issue number for the task related to the specific data structure you've chosen. Make sure that the issue's title only includes the name of the data structure you've chosen.

[Racso-3141]

• Linked List #33

Hello,
What data type should be used for the value field in the linkedlist node? Should it be int for now?

[Racso-3141]

• Binary Tree #34

[Racso-3141]

• Binary Search Tree (BST) #35

[Racso-3141]

• Heap #36

[Racso-3141]

• Doubly Linked List #37

[Racso-3141]

• Deque (Double-ended Queue) #38

[Racso-3141]

• Graph #40

[kaivalmehta]

• Implementation of an AVL tree for strict balancing. #46