The following articles describe various tree data structures. A tree is a hierarchical structure with a root node and its children, which in turn can have children of their own and thus form subtrees.
Pathfinding or shortest path algorithms are used to find a path (or the shortest path) between two nodes within a graph.
This category covers general articles about algorithms without any specific type of algorithm in mind, e.g., classifications of algorithms.
If you need a refresher on how the most common sorting algorithms work and how they differ, this series is for you.
In this tutorial series, you will learn everything about the abstract data type "stack", how to use it, and how to implement your own stack classes in Java.
In this tutorial series, you will learn everything about the abstract data type "queue", which methods it provides, how to use queues, when to use which queue implementation and how to program your own queues in Java.
In this tutorial series, you will learn everything about the abstract data type "deque", which methods it provides, how to use deques, when to use which deque implementation and how to program your own deques in Java.
What are data structures? A data structure is a collection of related data values and their relationships with each other. It provides operations to read or modify the data.
Java data structures are, for example, collections, maps, and sets, trees, queues, deques, and stacks.
In the following articles, you will find object-oriented, test-driven Java solutions for Advent of Code: