Data Structures Implementations

This repository contains basic implementations of fundamental data structures in Java, created as part of learning exercises.

Implemented Data Structures

• Skip Lists
  Probabilistic data structure that allows fast search, insertion, and deletion.

• Tree Data Structures
  Includes implementations of binary trees, binary search trees, and other tree variants.

• Tries
  Efficient data structure for storing strings and performing prefix-based searches.

Usage

• Each data structure has its own package or folder.
• Classes include basic operations such as:
  • Insert
  • Delete
  • Search
  • Traversal

Notes

• These are basic implementations intended for learning purposes.
• Optimizations and advanced features are not included.