Skip to content

README.md

Latest commit

 

History

History
48 lines (38 loc) · 867 Bytes

README.md

File metadata and controls

48 lines (38 loc) · 867 Bytes
Raw

Java Data Structures

Overview

This project contains simple examples of common data structures available in Java.
The goal of this repository is to practice how these structures work and how they are used in real Java applications.

Technologies

  • Java
  • Java Collections Framework

Data Structures Covered

ArrayList

  • Dynamic array implementation
  • Adding and accessing elements
  • Iterating through lists

LinkedList

  • Node-based list structure
  • Efficient insertions and removals
  • Comparison with ArrayList

Stack

  • LIFO (Last In First Out)
  • push()
  • pop()
  • peek()

Queue

  • FIFO (First In First Out)
  • offer()
  • poll()
  • peek()

HashMap

  • Key-value data structure
  • put()
  • get()
  • remove()
  • Iterating using keySet and entrySet

HashSet

  • Collection of unique elements
  • add()
  • remove()
  • contains()

Project Structure