Java

Complete Java Data Structures & Functions Table

Category Declaration Commonly Used Methods Traversal

[Link](arr) , [Link](arr, val) , for(int i = 0; i < [Link]; i++) {

1D Array int[] arr = new int[5]; [Link](arr, key) , //Code
[Link](arr) }

for(int i = 0; i < [Link]; i++) {

for(int j = 0; j < matrix[i].length; j++) {
[Link](matrix) ,
2D Array int[][] matrix = new int[3][3]; //Code
[Link](matrix[i], val)
}
}

for (int i = 0; i < [Link](); i++) {

for (int j = 0; j < [Link](i).size(); j++) {
List of Lists (2D List<List<Integer>> list = new [Link](new ArrayList<>()); , int num = [Link](i).get(j);
List) ArrayList<>(); [Link](i).add(val); , [Link]() // Process num
}
}

[Link](val) , [Link](i) , [Link](i, for(int i = 0; i < [Link](); i++) {

ArrayList<Integer> list = new
ArrayList val) , [Link](i) , //Code
ArrayList<>();
[Link](list) }

for(int i = 0; i < [Link](); i++) {

LinkedList<Integer> ll = new [Link](val) , [Link](val) ,
LinkedList //Code
LinkedList<>(); [Link](val) , [Link](i)
}

for(Node temp = head; temp != null;

class Node { int data; Node prev, temp = [Link]) {
Doubly LinkedList [Link] , [Link] , [Link]
next; } //Code
}

for(Node temp = head; [Link] !=

[Link] = head; (for circular head; temp = [Link]) {
Circular LinkedList class Node { int data; Node next; }
behavior) //Code
}

for(int i = 0; i < [Link](); i++) {

for(int j = 0; j < [Link](i).size(); j++)
Graph (Adjacency List<List<Integer>> graph = new {
[Link](i).add(node) , [Link]()
List) ArrayList<>(); //Code
}
}

for(int i = 0; i < V; i++) {

for(int j = 0; j < V; j++) {
Graph (Adjacency
int[][] graph = new int[V][V]; graph[i][j] = 1; , graph[i][j] == 1 //Code
Matrix) }
}

List<Integer> list = new ArrayList<>

(set);
HashSet<Integer> set = new [Link](val) , [Link](val) , for (int i = 0; i < [Link](); i++) {
HashSet
HashSet<>(); [Link](val) , [Link]() int num = [Link](i);
// Process num
}

List<Integer> list = new ArrayList<>

(ts);
TreeSet (Sorted TreeSet<Integer> ts = new [Link](val) , [Link]() , [Link]() , for (int i = 0; i < [Link](); i++) {
Set) TreeSet<>(); [Link](val) , [Link](val) int num = [Link](i);
// Process num
}

List<[Link]<Integer, String>> list =

new ArrayList<>([Link]());
for (int i = 0; i < [Link](); i++) {
[Link](key, val) , [Link](key) , [Link]<Integer, String> e =
HashMap (Key- HashMap<Integer, String> map =
[Link](key) , [Link](i);
Value Pair) new HashMap<>();
[Link](key) int key = [Link]();
String value = [Link]();
// Process key and value
}

TreeMap (Sorted TreeMap<Integer, String> tmap = [Link](key, val) , [Link]() , List<[Link]<Integer, String>> list =
new TreeMap<>(); new ArrayList<>([Link]());
Key-Value) [Link]() , [Link](key)
for (int i = 0; i < [Link](); i++) {
[Link]<Integer, String> e =

Java 1
 [Link](i);
int key = [Link]();
String value = [Link]();
// Process key and value
}

PriorityQueue (Min PriorityQueue<Integer> pq = new [Link](val) , [Link]() , [Link]() ,

while(![Link]()) [Link]();
Heap) PriorityQueue<>(); [Link]()

PriorityQueue<Integer> pq = new
PriorityQueue
PriorityQueue<> [Link](val) , [Link]() , [Link]() while(![Link]()) [Link]();
(Max Heap) ([Link]());

List<Integer> list = new ArrayList<>

(dq);
for (int i = 0; i < [Link](); i++) {
Deque (Double- Deque<Integer> dq = new [Link](val) , [Link](val) ,
int num = [Link](i);
Ended Queue) ArrayDeque<>(); [Link]() , [Link]()
[Link](num); // Process
num
}

Stack<Integer> stack = new Stack<> [Link](val) , [Link]() ,

Stack while(![Link]()) [Link]();
(); [Link]() , [Link]()

[Link]() , [Link](i) ,
for(int i = 0; i < [Link](); i++) {
[Link](a, b) , [Link](str) ,
String String str = "hello"; //Code
[Link]() , [Link]() , }
[Link](old, new) , [Link]()

for(int i = 0; i < [Link](); i++) {

StringBuilder sb = new [Link](val) , [Link](i, val) ,
StringBuilder //Code
StringBuilder("hello"); [Link](a, b) , [Link]()
}

for(int i = 0; i < [Link](); i++) {

StringBuffer sf = new [Link](val) , [Link](i, val) ,
StringBuffer //Code
StringBuffer("hello"); [Link](a, b) , [Link]()
}

[Link](x) , [Link](x) ,
[Link](a, b) , [Link](a, b) ,
Math Functions import [Link]; -
[Link](a, b) , [Link](x) ,
[Link](x) , [Link](x)

[Link](arr) , [Link](arr) ,
[Link](arr, key) ,
Array Functions import [Link]; -
[Link](arr, newSize) ,
[Link](arr1, arr2)

[Link](list) ,
[Link](list) ,
Collection
import [Link]; [Link](list) , -
Functions
[Link](list) ,
[Link](list)

[Link](x) ,
import [Link].*; import [Link]() ,
I/O Functions -
[Link]; [Link]() ,
[Link]()

Java 2