Data Structures

implementation of Datastructure in C/C++ Programming Language.

This Repository is based on the course of "Mastering Data structures and Algorithms using C and C++" by Abdul Bari sir.

Directories Description

1. Arrays

• DynamicMemory

  • Dynamic memory allocation in heap and use of malloc function.

• OperationOnArrays

  • Insert
  • Append
  • Delete
  • Sort
  • Display

• RecursiveArrays

  • Implementation of Array using recursive functions.

• SearchinginArrays

  • Linear search
  • Binary Search
  • Searching with recursion
  • Improving Linear Search
  • Linear Search Transposition
  • searching missing single or multiple elements

• SetOperations

  • Intersection of Two Arrays
  • Union of Two Arrays
  • Shift Merge and Reverse Operations on the Array

2. Matrices

3. LinkedList

• operationsOnLinkedList

  • Check for sorted list
  • Loop detection in a list
  • Merge two link lists
  • Reversing a link list
  • Concatenation operation
  • Remove duplicates
  • Deletion of node

• Student Challenge

  • Finding Middle element in a list
  • Generation of sparse matrix using Linked List
  • Generation of Polynomial Linked List

4. Stack

• Stack Implementation code using Array as well as Link List
• Application of Stack in infix to postfix Conversion

5. Queue

• Implementation code for Queue using Array, Link List, Stack.
• Circular Queue
• DEQueue
• Recursive Queue

6. binarytree

• Nodes in a binary tree
• Level Order Traversal using Queue
• Post Order Traversal using one stack without recursion
• Recursive Inorder, Postorder and Preorder traversal

7. BST

• Operations Binary search tree
• Recursive implementation of binary search tree

8. AVL

• Performing Rotation while Generation of BST

9. Heap

• Heapify method for faster heap creation
• Max heap
• Min heap

10. HashTable

• Chaining
• Linear Probing
• Quadratic Probing
• Double Hashing

11. Graph

12. Advanced : Not in Course

• Binary indexed tree
• Trie

Contributors:

• Fakhra Najm [email protected]
• Md Sharique Shahab [email protected]