-
Arrays Implementation of 1D and 2D arrays Operations: Insertion, Deletion, Searching, and Traversal
-
Linked Lists Singly Linked List Operations: Creation, Insertion, Deletion, Searching, and Traversal Doubly Linked List Operations: Creation, Insertion, Deletion, Searching, and Traversal Circular Linked List Operations: Creation, Insertion, Deletion, Searching, and Traversal
-
Stacks Array-based Stack Implementation Linked List-based Stack Implementation Applications: Infix to Postfix Conversion, Evaluation of Postfix Expression
-
Queues Array-based Queue Implementation Linked List-based Queue Implementation Circular Queue Implementation Deque Implementation
-
Trees Binary Tree Creation and Traversal (Inorder, Preorder, Postorder) Binary Search Tree (BST) Insertion, Deletion, Searching
-
Graphs Representation of Graphs using Adjacency Matrix and Adjacency List Implementation of Depth-First Search (DFS) Implementation of Breadth-First Search (BFS)
-
Sorting Algorithms Implementation of Bubble Sort, Selection Sort, Insertion Sort Implementation of Quick Sort and Merge Sort Implementation of Heap Sort
-
Searching Algorithms Linear Search Binary Search (Iterative and Recursive)
-
Notifications
You must be signed in to change notification settings - Fork 1
SandraMariyaGeorge/S3-DS-LAB
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
CSL 201_DATA STRUCTURES
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published