Data Structures is a crucial topics for computer science and engineering. It is the first step of problem solving and high perforamance computing.
In this project, I present generic implementations of several important data stuructures in JAVA.
Implementations does not only include the bare coding of the required algorithms but also nice class hierarchies, test classes and several interesting methods, including printing, toString, range finding, etc.
Implemented Data Stuructre
-
- Types: Weighted, Unweighted, directed, undirected
- Algorithms:
- DFS
- BFS
- Cycle detection
- Topological sort
- Traversals: pre order, mid order, post order, level order
-
- Binary Search Tree
- AVL Tree
- Red Black Tree
- B-Tree
Coming soon.. -
- Binary Min Heap
- Binary Max Heap
-
-
- Singly Linked List
- Doubly Linked List
- Circular Linked List
- Binary Max Heap
- Queue
- Stack
-