How naron2705/datastructure_tni works
This repository is a collection of Java data-structures and algorithms lab exercises, rather than one integrated application. The typical workflow is to run a console exercise, operate on a structure or dataset, and display or search the result. The tree identifies additional list, stack, queue, tree, sorting, and searching exercises beyond the sampled sources; their internal wiring is not assumed where source evidence is unavailable.
Main entry points: LabSheet12/src Search demos · LabSheet02/src Array exercises · LabSheet07/src List applications · LabSheet08/src Tree exercises
Components 23
Arrays
- Array exercises
LabSheet02/src - Number controller
LabSheet02/src/NumArrayController.java
Linked lists
- List exercises
LabSheet03/src - Singly linked list
LabSheet03/src/LinkedList.java - Doubly linked list
LabSheet04/src/DoublyLinkedList.java - List applications
LabSheet07/src - Singly-list API
LabSheet07/src/SinglyLinkedList.java
Stacks and queues
- Stack exercises
LabSheet05/src - Stack variants
LabSheet05/src/StackArrayBased.java - Queue exercises
LabSheet06/src - Queue variants
LabSheet06/src/QueueArrayBased.java - Printer queue demo
LabSheet06/src/LabQueue04.java
Trees
- Tree exercises
LabSheet08/src - Binary tree operations
LabSheet09/src/BinaryTree.java - Tree height
LabSheet08/src/TreeHeight.java - BST exercises
LabSheet10/src - Binary search tree
LabSheet10/src/BinarySearchTree.java
Sorting and search
- Sorting demo
LabSheet11/src/TestApp.java - Sorting algorithms
LabSheet11/src/Sorting.java - Search demos
LabSheet12/src - Search demo tree
LabSheet12/src/BinarySearchTree.java - Search methods
LabSheet12/src
Other components
- Learner
Connections 17
- Learner → Array exercises: runs
- Array exercises → Number controller: uses
- Learner → List exercises: runs
- Learner → List applications: runs
- List applications → Singly-list API: exercises
- Learner → Stack exercises: runs
- Learner → Queue exercises: runs
- Learner → Printer queue demo: runs
- Learner → Tree exercises: runs
- Tree exercises → Tree height: calculates
- Learner → BST exercises: runs
- BST exercises → Binary search tree: operates
- Learner → Sorting demo: runs
- Sorting demo → Sorting algorithms: sorts with
- Learner → Search demos: runs
- Search demos → Search demo tree: builds
- Search demos → Search methods: searches with