Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.
Awesome Lists | Featured Topics | Projects
https://github.com/zannatul-naim/data-structure

CSE-2122 Data Structure Lab
https://github.com/zannatul-naim/data-structure
algorithm array array-methods bfs-algorithm data-structures dfs-algorithm graph linked-list matrix queue stack tree
Last synced: 11 days ago
JSON representation
CSE-2122 Data Structure Lab
Host: GitHub
URL: https://github.com/zannatul-naim/data-structure
Owner: Zannatul-Naim
Created: 2022-05-25T14:16:03.000Z (over 2 years ago)
Default Branch: main
Last Pushed: 2023-05-29T02:27:46.000Z (over 1 year ago)
Last Synced: 2023-05-29T03:25:13.031Z (over 1 year ago)
Topics: algorithm, array, array-methods, bfs-algorithm, data-structures, dfs-algorithm, graph, linked-list, matrix, queue, stack, tree
Language: C
Homepage:
Size: 153 KB
Stars: 0
Watchers: 1
Forks: 1
Open Issues: 0
Metadata Files:
- Readme: README.md
Awesome Lists containing this project

README

        # Data-Structure

## Reference Book 

- Data Structure using C by Reema Theraja

- Data Structure with C by Seymour Lipschutz

#### Topics covered

| Serial | Topic |

| :-----| :-----:|

|1| [Array](#array)|

|2| [Linked List](#linkedlist)|

|3| [Stack](#stack)|

|4| [Queue](#queue)|

|5| [Recursion](#recursion)|

|6| [Hashing](#hashing)|

|7| [Sorting](#sorting)|

|8| [Searching](#searching)|

|9| [Tree](#tree)|

|10| [Graph](#graph)|

### Array

- [Traversing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/traversing.c)

- [Second Largest Element](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/second_largest.c)

- [Find Duplicate value](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/duplicate.c)

- [Insert an element to a sorted array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/insert_1.c)

- [Insert an element to a unsorted array in any position](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/insert_2.c)

- [Delete an existing element from an array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/delete.c)

- [Delete middle value of an array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/delete_mid.c)

- [Merge two Unsorted Array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/merge_1.c)

- [Merge two sorted Array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/merge_2.c)

- [Sorting an array using Bubble Sort](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/bubble_sort.c)

- [Searching an element Using Binary Search](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/binary_search.c)

- [Copy 2D array to 1D array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/2D_to_1D.c)

- [Matrix](https://github.com/Zannatul-Naim/Data-Structure/tree/main/Array/Matrix)

  - [Addition](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/Matrix/addition.c)

  - [Subtraction](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/Matrix/subtraction.c)

  - [Inverse](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/Matrix/inverse.c)

  - [Transpose](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/Matrix/transpose.c)

  - [Multiplication](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/Matrix/multiplication.c)

  

  

### Searching

  - [Linear Search](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Searching/linear_search.c)

  - [Binary Search](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Searching/binary_search.c)

  

  

### Sorting

  - [Insertion Sort](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Sorting/insertion_sort.c)

  - [Bubble Sort](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Sorting/bubble_sort.c)

  - [Quick Sort](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Sorting/quick_sort.cpp)

### LinkedList

- [Singly Linked List](https://github.com/Zannatul-Naim/Data-Structure/tree/main/Linked%20List/Singly_Linked_List)

  - [Singly Linked List - All](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Singly_Linked_List/singly_linked_list.cpp)

  - [Linked List traversing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/traversing.c)

  - [Inserting at last](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/append.c)

  - [Insert at first](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/insertFirst.c)

  - [Insert at Kth position](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/insert_kth_position.c)

  - [Deleting last element](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/deleteLast.c)

  - [Deleting first element](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/deleteFirst.c)

  - [Deleting specific Data](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Singly_Linked_List/delete_a_data.c)

  - [Deletig Nth node](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Singly_Linked_List/delete_nth_node.c)

- [Doubly Linked List](https://github.com/Zannatul-Naim/Data-Structure/tree/main/Linked%20List/Doubly_Linked_List)

  - [Create Doubly Linked List](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Doubly_Linked_List/create_doubly_list.c)

  - [Insert at beginning](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Doubly_Linked_List/insertFirst.c)

  - [Insert at end](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Doubly_Linked_List/insertLast.c)

  - [Insert at Nth node](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Doubly_Linked_List/insert_at_nth_position.c)

- [Circular Linked List](https://github.com/Zannatul-Naim/Data-Structure/tree/main/Linked%20List/Circular_Linked_List)

  - [Insert at First](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Circular_Linked_List/insertBeg.c)

### Stack

- [Basic stack operations program](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Stack/stack.c) implemented using array in C

- [Stack using Linked List](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Stack/linked_list_stack.c)

- [Infix to Postfix Conversion](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Stack/infixToPostFix.cpp)

- [Postfix Expression Evaluation](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Stack/postFixEvaluation.cpp)

- [Infix Expression Evaluation](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Stack/infixEvaluation.cpp)

### Queue

  - [Basic Queue Implementation Using Array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Queue/array_queue.c)

  - [Queue using Linked List](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Queue/linked_list_queue.c)

  - [Circular Queue using array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Queue/circular_array_queue.c)

  - [Circular Queue Using LinkedList](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Queue/circular_linked_queue.c)

### Recursion

  - [Factorial](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Recursion/factorial.c)

  - [Fibonacci](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Recursion/fibonacci.c)

  - [Towe of Hanoi](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Recursion/tower_of_hanoi.c)

### Hashing

  - [Simple Hash map table](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Hashing/hash_map_table.c)

  - [Hashing using Linear Probing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Hashing/linear_probing.c)

  - [Hashing using Quadratic Probing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Hashing/quadratic_probing.c)

  - [Hashing using separate chaining](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Hashing/separate_chaining.c)

  - [Hashing using Plus-3 Probing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Hashing/plus_3_probing.c)

### Tree

  - [Binary Tree](https://github.com/Zannatul-Naim/Data-Structure/tree/main/Tree/Binary_Tree)

    - [First Tree Program (Creating)](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/Binary_Tree/implementation.c)

    - [Implementation in java](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/Binary_Tree/BinaryTree.java) creating, inserting, searching

    - [Level Order Traversing in a Binary Tree](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/Binary_Tree/bTree_level_order_traversing.cpp)

    - [Binary Tree Using C++](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/Binary_Tree/binaryTree.cpp) (Traversing Preorder, Postorder, Inorder)

    - [Iterative Pre Order Traversing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/Binary_Tree/iterative_preOrder.cpp)

    - [Iterative In Order Traversing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/Binary_Tree/iterative_inorder.cpp)

    - [Iterative Post Order Traversing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/Binary_Tree/iterative_postorder.cpp)

    

  - [Binary Search Tree](https://github.com/Zannatul-Naim/Data-Structure/tree/main/Tree/BinarySearchTree)

    - [Insertion in a BST](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/BinarySearchTree/bst_inserting.cpp)

    - [BST insertion deletion](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/BinarySearchTree/unique_bst.cpp)

### Heap

  - [Heap implementation (insertion, deletion)](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Heap/insertion_deletion.cpp)

  - [Heapify Algorithm](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Heap/insertion_deletion.cpp)

  

### Graph

  - [Adjacency Matrix Representation](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/adjacency_matrix.cpp)

  - [Path Matrix - Find connectivity](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/path_matrix.cpp)

  - [Power Matrix](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/power_matrix.cpp)

  - [LinkedList Representation of graph with BFS and DFS](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/linked_list_representation_of_graph_with_bfs_dfs.cpp)

  - [Adjacency List Representation in C++](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/adjacency_list.cpp)

  - [Adjacency List Representation in C](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/adjacency_list.c)

  - [shortest path matrix (weighted graph) warshall](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/shortest_path_matrix.cpp)

  - [BFS C++](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/bfs.cpp)

  - [DFS C++](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/dfs.cpp)

  - [Java Implementation](https://github.com/Zannatul-Naim/Data-Structure/tree/main/Graph/Java-Implementation)

      - [Simple Graph](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/Java-Implementation/Graph.java)

      - [Breadth First Search](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/Java-Implementation/BFS)

      - [Depth First Search](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/Java-Implementation/DFS.java)