Data_Structures.md

Data Structures

• Arrays
• Linked Lists
• Trees
• Balanced Trees
• Stacks
• Queues
• Heap
• Disjoint Set
• Trie
• Advanced

Arrays

Arrays - DS

• cpp

2D Array - DS

• cpp

Dynamic Array

• cpp

Left Rotation

• cpp

Sparse Arrays

• cpp

Array Manipulation

• cpp

Linked Lists

Print the Elements of a Linked List

• cpp

Insert a Node at the Tail of a Linked List

• cpp

Insert a node at the head of a linked list

• cpp

Insert a node at a specific position in a linked list

• cpp

Delete a Node

• cpp

Print in Reverse

• cpp

Reverse a linked list

• cpp

Compare two linked lists

• cpp

Merge two sorted linked lists

• cpp

Get Node Value

• cpp

Delete duplicate-value nodes from a sorted linked list

• cpp

Cycle Detection

• cpp
• cpp using a set

Find Merge Point of Two Lists

• cpp
• cpp using a set

Inserting a Node Into a Sorted Doubly Linked List

• cpp

Reverse a doubly linked list

• cpp

Trees

Tree: Preorder Traversal

• cpp

Tree: Postorder Traversal

• cpp

Tree: Inorder Traversal

• cpp

Tree: Height of a Binary Tree

• cpp

Tree: Top View

• cpp

Tree: Level Order Traversal

• cpp

Binary Search Tree: Insertion

• cpp

Tree: Huffman Decoding

• cpp

Binary Search Tree: Lowest Common Ancestor

• cpp

Swap Nodes[Algo]

• cpp

Is This a Binary Search Tree?

• cpp

Balanced Trees

Stacks

Queues

Heap

Disjoint Set

Trie

Advanced