Home
Whiteboard
Online Compilers
Practice
Articles
Tools
Chapters
Categories
Library
Courses
Certifications
Login
Java Data Structures - Home
Creating Arrays
Inserting Elements in an Array
Remove Elements From Array
Joining two Arrays
Sorting Array Elements
Searching elements in an Array
Two Dimensional Arrays
Loop through an array
Java Data Structures Bitset
Bitset Class
Creating a Bitset
Adding values to the Bitset
Remove elements from a BitSet
Verifying if the BitSet is empty
Printing the elements of the BitSet
Java Data Structures Vector
Vector Class
Creating a Vector
Adding elements to a Vector
Removing elements from a Vector
Verifying if the Vector is empty
Clearing the elements of the Vector
Printing the elements of the Vector
Java Data Structures Stack
Stack Class
Creating a Stack
Pushing elements to a Stack
Popping elements from a Stack
Verifying if a Stack is empty
Clearing the elements of a Stack
Printing the elements of a Stack
Java Data Structures Queue
Priority Queue class
Creating a Queue
Adding elements to a Queue
Remove elements from a queue
Clearing the elements of the Queue
Printing the elements of the Queue
Java Data Structures Linked List
Linked List Class
Creating a linked list
Add elements to a linked list
Remove elements from a linked list
Doubly linked lists
Circular linked lists
Java Data Structures Set
Set Interface
Creating a Set
Adding elements to a Set
Remove elements from a Set
Loop through a Set
Adding two Sets
Subtract two Sets
Java Data Structures Dictionaries
Dictionary class
Creating Dictionary
Adding elements to a Dictionary
Remove elements from a Dictionary
Retrieving values in a Dictionary
Loop through a Dictionary
Java Data Structures Hash Table
HashTable Class
Creating a hash table
Add elements to a hash table
Remove elements from a hash table
Retrieving values in a hash table
Loop through a hash table
Joining two hash tables
Java Data Structures Tree
Creating a Binary Tree
Inserting a key into a tree
In-order traversal in a tree
Pre-order traversal in a tree
Post-order traversal in a tree
Searching for minimum value in a tree
Searching for maximum value in a tree
Searching for values in a tree
Removing a leaf node in a tree
AVL tree
Java Data Structures Graph
Breadth-first search (BFS)
Depth-first search (DFS)
Shortest path algorithms
Minimum spanning tree (MST)
Kruskal's algorithm
Java Data Structures Sorting Algorithm
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort
Java Data Structures Searching
Linear Search
Binary Search
Java Data Structures Recursion
Recursion
Java Data Structures Dynamic Programming
Fibonacci sequence
knapsack problem
Java Data Structures Greedy Algorithms
Components of Greedy Algorithm
Java Data Structures Algorithm Complexity
Algorithm Analysis
Java Data Structures Asymptotic Analysis
Asymptotic Notations
Java Data Structures Resources
Java Data Structures - Quick Guide
Java Data Structures - Resources
Java Data Structures - Discussion
Selected Reading
UPSC IAS Exams Notes
Developer's Best Practices
Questions and Answers
Effective Resume Writing
AI Based Resume Builder
Personal AI Study Assistant
Generate Coding Logic
HR Interview Questions
Computer Glossary
Who is Who
Quiz on Asymptotic Notations in Java Data Structures
Print Page
Submit
Review
Advertisements
