Skip to content

Implementations of several data structures used in computing, such as Binary Search Tree, AVL Tree, etc.

License

Notifications You must be signed in to change notification settings

acdirican/data-structures-kitchen

Repository files navigation

Data Structures Kitchen

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

  • Graphs

    • Types: Weighted, Unweighted, directed, undirected
    • Algorithms:
      • DFS
      • BFS
      • Cycle detection
      • Topological sort
      • Traversals: pre order, mid order, post order, level order
  • Trees

    • Binary Search Tree
    • AVL Tree

    • Coming soon..
    • Red Black Tree
    • B-Tree
  • Heaps

    • Binary Min Heap
    • Binary Max Heap
  • Lists

    • Linked List

      • Singly Linked List
      • Doubly Linked List
      • Circular Linked List
      • Binary Max Heap
    • Queue
    • Stack

About

Implementations of several data structures used in computing, such as Binary Search Tree, AVL Tree, etc.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages