An abstract data type for a (2,4) search tree
-
Updated
Jan 1, 2018 - Java
An abstract data type for a (2,4) search tree
A Java implementation of the Trie data structure
Using greedy and breadth-first search to find shortest path between two U-Bahn stations.
Repository for the lab work of Algorithms and Data Structures Course.
Learned Data Structures and Algorithms: Basic Programming Constructs, Data types, Search trees, Hashing, Complexity Analysis, Algorithm design, Graph algorithms, Sort algorithms
Add a description, image, and links to the search-trees topic page so that developers can more easily learn about it.
To associate your repository with the search-trees topic, visit your repo's landing page and select "manage topics."