×

DS - Basics

• Structured Programming
• Data Structure Types & Operations
• DS - Introduction
• Linear, Binary & Interpolation Search

DS - Array

• Array Data Structure
• Array coding problems

DS - Linked List

• Linked List - Introduction
• Single Linked List
• Single Linked List Insertion
• Single Linked List Deletion
• Deleting Node from Linked List W/O Head Pointer
• Implement Union & Intersection of Two Sorted Linked Lists

DS - Stack

• Stack
• Stack Implement Using Array
• Multi Stack Implement
• Nesting of Parentheses Using Stack
• Check for Balanced Parentheses Using Stacks
• Double Stack
• Stack Implement Using Two Queues

DS - Queue

• Linear Queue
• Circular Queue
• Double Ended Queue (DeQueue)
• Priority Queue
• Implementation of Queue using two Stacks

DS Hashing

• Hashing Data Structure
• Hash Functions & Characteristics
• Collisions in Hashing & Collision Resolution Techniques
• Hashing Separate chaining for Collision Resolution
• Hashing Open Addressing for Collision Handling
• Hashing Coding Problems

DS Tree

• Tree Data structure
• Trees - Introduction & Terminologies
• Binary tree, Definition & Properties
• BST
• Binary Tree Representation
• Traversal Technique For Binary Tree
• Insertion in BST | Set 1
• Insertion in Binary Search | Set 2
• Deletion in BST | Set 1
• Deletion in BST | Set 2
• Hash Table Vs. BST
• Construct BST from Given Preorder Traversal
• Construct BST From Sorted Linked List
• Construct BST From Sorted 1-D Array
• Convert BST to Greater Sum Tree
• Convert BST to Smaller Sum Tree
• Construct All Possible BSTs With Keys 1 to N
• Convert BST to Min-heap
• Construct BST From Level Order Traversal
• Convert Unbalanced BST to Balanced BST
• Check if Array Can Represent Preorder Traversal of BST
• Kth Minimum in BSTTree
• Kth Maximum in BST
• Check if Sorted Subsequence Exits in BST or Not
• Check if the BST contains a dead end
• Check if the given array can represent inorder traversal of a BST
• Check if two BSTs have same set of elements or not
• Largest Element in the BST less than or Equal to N
• Distance between two nodes in a BST
• Count Number of pairs from two different BSTs whose sum is equal to X
• Merge Two BSTs Set 1
• Merge two BSTs set 2 (limited space)
• Find the Minimum and Maximum node in a BST
• Find Height (Maximum Depth) of a BST (C++ program)
• Find the Number of Nodes in a BST (C++ program)
• Find the number of leaf nodes in a Binary Tree | Data Structure
• Find whether two trees are structurally identical or not | Data Structure
• AVL Tree, Left and right rotations
• Introduction to B Tree and its operations
• Red Black Tree (Properties, Advantages, Inserting Nodes)
• Interval Tree in Data Structure
• Threaded Binary Tree | Data Structure
• Level Order Traversal on a Binary Tree | Data Structure
• Segment Trees
• Construct a Binary Tree from Postorder and Inorder Traversal

DS - Graph

• Introduction to Graph in Data Structure
• Representation of a Graph in Data Structure
• Breath First Search (BFS) of a Graph
• Depth First Search (DFS) of a Graph
• Cycle Detection in an Undirected Graph
• Cycle Detection in a Directed Graph
• Prim's Minimum Spanning Tree
• Count all the possible path between two vertices
• Insertion and deletion of nodes and edges in a graph using adjacency list

DS Programs Using C/C++

• Quick Sort in C++ with Algorithm, Example
• Merge Sort in C++ with Example
• Counting Sort with C++ Example
• Implement shell sort using C++ program
• Dijkstra's Algorithm: Explanation and Implementation withC++ program
• C++ print Postorder traversal from Preorder and Inorder traversal of a tree
• Infix To Postfix Conversion Using Stack [with C program]
• Evaluation of Postfix Expressions Using Stack [with C program]
• Maximum Sum Helix path (using C++ program)
• Tower of Hanoi using recursion (C++ program)
• Find in-order Successor and Predecessor in a BST using C++ program
• Implement in-order traversal using C++ program
• Implement post-order traversal using C++ program
• Implement pre-order traversal using C++ program
• Find occurrence of each element in an array using simple method O(n^2) and hashing O(n) time
• Check for balanced parentheses by using Stacks (C++ program)

DS - Miscellaneous Topics

• Augmenting Data Structure
• Tail Recursion and Tower of Hanoi using C
• Asymptotic Notations
• Hashing
• Hamiltonian Cycle in Data Structure
• Aggressive Cows (On Binary Search)
• Find Maximum Range of Query using Segment Trees
• Introduction to Heap Data Structure
• Rearrange a string so that no two adjacent characters have the same letter
• Heap Sort
• Disjoint Set ADT