https://github.com/pc9795/ds-algo-java

Data structures and Algorithms implemented in Java :coffee:. Some theory notes also.
https://github.com/pc9795/ds-algo-java

algorithms data-structures java

Last synced: 21 days ago
JSON representation

Data structures and Algorithms implemented in Java :coffee:. Some theory notes also.

• Host: GitHub
• URL: https://github.com/pc9795/ds-algo-java
• Owner: pc9795
• Created: 2017-07-02T18:54:02.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2022-06-14T22:51:34.000Z (over 2 years ago)
• Last Synced: 2024-11-05T16:48:39.561Z (2 months ago)
• Topics: algorithms, data-structures, java
• Language: Java
• Homepage:
• Size: 1.49 MB
• Stars: 2
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Contributing: CONTRIBUTING.md

Awesome Lists containing this project

README

        
## Data structures

Implemented data structures in this repository:

* [Fenwick Tree](src/main/java/gfg/ds/advanced/fenwick_tree)

* [Segment Tree](src/main/java/gfg/ds/advanced/segment_tree)

* [Suffix Tree](src/main/java/gfg/ds/advanced/suffix_tree)

* [Trie](src/main/java/gfg/ds/advanced/trie/Trie.java)

* [Ternary Search Tree](src/main/java/gfg/ds/advanced/trie/TernarySearchTree.java) 

* [B-tree](src/main/java/gfg/ds/advanced/BTree.java)

* [Cartesian Tree](src/main/java/gfg/ds/advanced/CartesianTree.java)

* [Difference Array](src/main/java/gfg/ds/advanced/DiffArray.java)

* [Interval Tree](src/main/java/gfg/ds/advanced/IntervalTree.java)

* [KD Tree](src/main/java/gfg/ds/advanced/KDTree.java)

* [Sparse Set](src/main/java/gfg/ds/advanced/SparseSet.java)

* [Graph](src/main/java/gfg/ds/graph)

* [Binary Heap](src/main/java/gfg/ds/heap/BinaryMinHeap.java)

* [Binomial Heap](src/main/java/gfg/ds/heap/BinomialHeap.java) 

* [Singly Linked List](src/main/java/gfg/ds/linked_list/SinglyLinkedList.java)

* [Doubly Linked List](src/main/java/gfg/ds/linked_list/DoublyLinkedList.java)

* [Circular Linked List](src/main/java/gfg/ds/linked_list/CircularLinkedList.java)

* [Queue](src/main/java/gfg/ds/queue)

* [Stack](src/main/java/gfg/ds/stack)

* [Binary Tree](src/main/java/gfg/ds/tree/binary_tree/BinaryTree.java)

* [Binary Search Tree](src/main/java/gfg/ds/tree/binary_search_tree/BinarySearchTree.java)

* [AVL Tree](src/main/java/gfg/ds/tree/binary_search_tree/balanced/AVLTree.java)

* [Red Black Tree](src/main/java/gfg/ds/tree/binary_search_tree/balanced/RedBlackTree.java)

* [Splay Tree](src/main/java/gfg/ds/tree/binary_search_tree/balanced/SplayTree.java)

* [Treap](src/main/java/gfg/ds/tree/binary_search_tree/balanced/Treap.java)

* [Union Find](src/main/java/gfg/ds/union_find/UnionFind.java)

Most of the data-structures have existing **test-cases** to explore various functionality and **time/space complexity** 

mentioned in the method comments.

If you want to contribute read [CONTRIBUTING.md](CONTRIBUTING.md)