https://github.com/parth1899/advanced-data-structures

This repository contains C implementations of various Advanced Data Structures, including Graphs, Linked Lists, Sorting, Stacks, and Trees.
https://github.com/parth1899/advanced-data-structures

Last synced: 6 months ago
JSON representation

This repository contains C implementations of various Advanced Data Structures, including Graphs, Linked Lists, Sorting, Stacks, and Trees.

• Host: GitHub
• URL: https://github.com/parth1899/advanced-data-structures
• Owner: parth1899
• Created: 2023-11-27T18:49:32.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2025-02-26T21:38:23.000Z (over 1 year ago)
• Last Synced: 2025-02-26T22:28:38.303Z (over 1 year ago)
• Language: C
• Homepage:
• Size: 37.1 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Advanced Data Structures

## 📌 Overview

This repository contains implementations of various **Advanced Data Structures** covered in my course curriculum. The programs include algorithms for **graphs, linked lists, sorting techniques, stacks, and trees**.

## 📂 Repository Structure

```

Advanced-Data-Structures/

│── Graphs/                     # Graph algorithms

│   │── BFS_List.c               # Breadth-First Search using adjacency list

│   │── DFS_List.c               # Depth-First Search using adjacency list

│   │── Djikstras_List.c         # Dijkstra's shortest path algorithm

│   │── Kruskals_List.c          # Kruskal’s Minimum Spanning Tree (MST) using list

│   │── Kruskals_Matrix.c        # Kruskal’s MST using adjacency matrix

│   │── Prims_List.c             # Prim’s MST using adjacency list

│   │── Prims_Matrix.c           # Prim’s MST using adjacency matrix

│

│── LinkedList/                  # Linked list implementations

│   │── DoublyLinkedList.c        # Doubly Linked List operations

│

│── Sorting/                     # Sorting algorithms

│   │── HeapSort.c               # Heap Sort

│   │── MergeSort.c              # Merge Sort

│   │── QuickSort.c              # Quick Sort

│

│── Stacks/                      # Stack-based applications

│   │── infix_to_postfix.c       # Convert infix expressions to postfix

│   │── infix_to_prefix.c        # Convert infix expressions to prefix

│

│── Trees/                       # Tree data structures

│   │── AVL.c                    # AVL Tree implementation

│   │── BST.c                    # Binary Search Tree (BST) implementation

│   │── BST_operations.c         # BST operations (insert, delete, search)

│   │── Non-Recursive-BST-Operations.c  # Non-recursive BST operations

│   │── TBT.c                    # Threaded Binary Tree (TBT) implementation

```

## 📖 Topics Covered

✅ Graph Traversal: BFS, DFS, Dijkstra’s, Kruskal’s, Prim’s algorithms  

✅ Linked Lists: Doubly Linked List operations  

✅ Sorting: Heap Sort, Merge Sort, Quick Sort  

✅ Stacks: Infix to Postfix & Prefix conversion  

✅ Trees: BST, AVL, TBT & their operations