Here are some data structure concepts and their implementations

TREES:

A Tree is a non-linear data structure where data objects are organized in terms of hierarchical relationship. ... Java provides two in-built classes, Tree-Set and Tree-map

Click here to view some tree Programs and their implementation: TREES

GRAPH:

A graph is a data structure for storing connected data like a network of people on a social media platform. A graph consists of vertices and edges. A vertex represents the entity (for example, people) and an edge represents the relationship between entities (for example, a person's friendships).

Click here to view some Graph problems and their implementations: GRAPH

LINKED LIST:

Linked List are linear data structures where the elements are not stored in contiguous locations and every element is a separate object with a data part and address part. The elements are linked using pointers and addresses. Each element is known as a node. ... In Java, LinkedList class implements the list interface.

CLicK here to view some problems in Linked list: LINKED LIST

STACK:

A Stack is a Last In First Out (LIFO) data structure. It supports two basic operations called push and pop. The push operation adds an element at the top of the stack, and the pop operation removes an element from the top of the stack. Java provides a Stack class which models the Stack data structure.

Click here to view some Stack Problems: STACK

QUEUE:

Java Queue is a collection of ordered elements (Or objects) but it performs insert and remove operations differently. We can use Queue to store elements before processing those elements.

Click here to view some Queue problems: QUEUE