{"id":18564524,"url":"https://github.com/zannatul-naim/data-structure","last_synced_at":"2025-06-21T21:40:28.721Z","repository":{"id":37583145,"uuid":"496260997","full_name":"Zannatul-Naim/Data-Structure","owner":"Zannatul-Naim","description":"CSE-2122 Data Structure Lab","archived":false,"fork":false,"pushed_at":"2023-05-29T02:27:46.000Z","size":158,"stargazers_count":1,"open_issues_count":0,"forks_count":2,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-17T13:13:53.318Z","etag":null,"topics":["algorithm","array","array-methods","bfs-algorithm","data-structures","dfs-algorithm","graph","linked-list","matrix","queue","stack","tree"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Zannatul-Naim.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2022-05-25T14:16:03.000Z","updated_at":"2023-10-12T05:13:55.000Z","dependencies_parsed_at":"2022-07-10T04:17:18.787Z","dependency_job_id":null,"html_url":"https://github.com/Zannatul-Naim/Data-Structure","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Zannatul-Naim%2FData-Structure","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Zannatul-Naim%2FData-Structure/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Zannatul-Naim%2FData-Structure/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Zannatul-Naim%2FData-Structure/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Zannatul-Naim","download_url":"https://codeload.github.com/Zannatul-Naim/Data-Structure/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254398021,"owners_count":22064603,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","array","array-methods","bfs-algorithm","data-structures","dfs-algorithm","graph","linked-list","matrix","queue","stack","tree"],"created_at":"2024-11-06T22:15:34.021Z","updated_at":"2025-05-15T18:33:34.367Z","avatar_url":"https://github.com/Zannatul-Naim.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Data-Structure\n\n## Reference Book \n- Data Structure using C by Reema Theraja\n- Data Structure with C by Seymour Lipschutz\n\n#### Topics covered\n\n| Serial | Topic |\n| :-----| :-----:|\n|1| [Array](#array)|\n|2| [Linked List](#linkedlist)|\n|3| [Stack](#stack)|\n|4| [Queue](#queue)|\n|5| [Recursion](#recursion)|\n|6| [Hashing](#hashing)|\n|7| [Sorting](#sorting)|\n|8| [Searching](#searching)|\n|9| [Tree](#tree)|\n|10| [Graph](#graph)|\n\n\n### Array\n\n- [Traversing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/traversing.c)\n- [Second Largest Element](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/second_largest.c)\n- [Find Duplicate value](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/duplicate.c)\n- [Insert an element to a sorted array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/insert_1.c)\n- [Insert an element to a unsorted array in any position](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/insert_2.c)\n- [Delete an existing element from an array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/delete.c)\n- [Delete middle value of an array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/delete_mid.c)\n- [Merge two Unsorted Array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/merge_1.c)\n- [Merge two sorted Array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/merge_2.c)\n- [Sorting an array using Bubble Sort](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/bubble_sort.c)\n- [Searching an element Using Binary Search](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/binary_search.c)\n- [Copy 2D array to 1D array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/2D_to_1D.c)\n\n- [Matrix](https://github.com/Zannatul-Naim/Data-Structure/tree/main/Array/Matrix)\n  - [Addition](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/Matrix/addition.c)\n  - [Subtraction](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/Matrix/subtraction.c)\n  - [Inverse](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/Matrix/inverse.c)\n  - [Transpose](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/Matrix/transpose.c)\n  - [Multiplication](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Array/Matrix/multiplication.c)\n  \n  \n### Searching\n  - [Linear Search](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Searching/linear_search.c)\n  - [Binary Search](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Searching/binary_search.c)\n  \n  \n### Sorting\n  - [Insertion Sort](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Sorting/insertion_sort.c)\n  - [Bubble Sort](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Sorting/bubble_sort.c)\n  - [Quick Sort](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Sorting/quick_sort.cpp)\n\n### LinkedList\n\n- [Singly Linked List](https://github.com/Zannatul-Naim/Data-Structure/tree/main/Linked%20List/Singly_Linked_List)\n  - [Singly Linked List - All](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Singly_Linked_List/singly_linked_list.cpp)\n  - [Linked List traversing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/traversing.c)\n  - [Inserting at last](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/append.c)\n  - [Insert at first](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/insertFirst.c)\n  - [Insert at Kth position](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/insert_kth_position.c)\n  - [Deleting last element](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/deleteLast.c)\n  - [Deleting first element](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/deleteFirst.c)\n  - [Deleting specific Data](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Singly_Linked_List/delete_a_data.c)\n  - [Deletig Nth node](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Singly_Linked_List/delete_nth_node.c)\n\n\n- [Doubly Linked List](https://github.com/Zannatul-Naim/Data-Structure/tree/main/Linked%20List/Doubly_Linked_List)\n  - [Create Doubly Linked List](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Doubly_Linked_List/create_doubly_list.c)\n  - [Insert at beginning](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Doubly_Linked_List/insertFirst.c)\n  - [Insert at end](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Doubly_Linked_List/insertLast.c)\n  - [Insert at Nth node](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Doubly_Linked_List/insert_at_nth_position.c)\n\n- [Circular Linked List](https://github.com/Zannatul-Naim/Data-Structure/tree/main/Linked%20List/Circular_Linked_List)\n  - [Insert at First](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Linked%20List/Circular_Linked_List/insertBeg.c)\n\n### Stack\n- [Basic stack operations program](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Stack/stack.c) implemented using array in C\n- [Stack using Linked List](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Stack/linked_list_stack.c)\n- [Infix to Postfix Conversion](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Stack/infixToPostFix.cpp)\n- [Postfix Expression Evaluation](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Stack/postFixEvaluation.cpp)\n- [Infix Expression Evaluation](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Stack/infixEvaluation.cpp)\n\n\n### Queue\n  - [Basic Queue Implementation Using Array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Queue/array_queue.c)\n  - [Queue using Linked List](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Queue/linked_list_queue.c)\n  - [Circular Queue using array](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Queue/circular_array_queue.c)\n  - [Circular Queue Using LinkedList](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Queue/circular_linked_queue.c)\n\n\n### Recursion\n  - [Factorial](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Recursion/factorial.c)\n  - [Fibonacci](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Recursion/fibonacci.c)\n  - [Towe of Hanoi](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Recursion/tower_of_hanoi.c)\n\n### Hashing\n  - [Simple Hash map table](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Hashing/hash_map_table.c)\n  - [Hashing using Linear Probing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Hashing/linear_probing.c)\n  - [Hashing using Quadratic Probing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Hashing/quadratic_probing.c)\n  - [Hashing using separate chaining](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Hashing/separate_chaining.c)\n  - [Hashing using Plus-3 Probing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Hashing/plus_3_probing.c)\n\n### Tree\n  - [Binary Tree](https://github.com/Zannatul-Naim/Data-Structure/tree/main/Tree/Binary_Tree)\n    - [First Tree Program (Creating)](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/Binary_Tree/implementation.c)\n    - [Implementation in java](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/Binary_Tree/BinaryTree.java) creating, inserting, searching\n    - [Level Order Traversing in a Binary Tree](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/Binary_Tree/bTree_level_order_traversing.cpp)\n    - [Binary Tree Using C++](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/Binary_Tree/binaryTree.cpp) (Traversing Preorder, Postorder, Inorder)\n    - [Iterative Pre Order Traversing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/Binary_Tree/iterative_preOrder.cpp)\n    - [Iterative In Order Traversing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/Binary_Tree/iterative_inorder.cpp)\n    - [Iterative Post Order Traversing](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/Binary_Tree/iterative_postorder.cpp)\n    \n  - [Binary Search Tree](https://github.com/Zannatul-Naim/Data-Structure/tree/main/Tree/BinarySearchTree)\n    - [Insertion in a BST](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/BinarySearchTree/bst_inserting.cpp)\n    - [BST insertion deletion](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Tree/BinarySearchTree/unique_bst.cpp)\n\n### Heap\n  - [Heap implementation (insertion, deletion)](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Heap/insertion_deletion.cpp)\n  - [Heapify Algorithm](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Heap/insertion_deletion.cpp)\n  \n### Graph\n  - [Adjacency Matrix Representation](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/adjacency_matrix.cpp)\n  - [Path Matrix - Find connectivity](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/path_matrix.cpp)\n  - [Power Matrix](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/power_matrix.cpp)\n  - [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)\n  - [Adjacency List Representation in C++](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/adjacency_list.cpp)\n  - [Adjacency List Representation in C](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/adjacency_list.c)\n  - [shortest path matrix (weighted graph) warshall](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/shortest_path_matrix.cpp)\n  - [BFS C++](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/bfs.cpp)\n  - [DFS C++](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/dfs.cpp)\n  - [Java Implementation](https://github.com/Zannatul-Naim/Data-Structure/tree/main/Graph/Java-Implementation)\n      - [Simple Graph](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/Java-Implementation/Graph.java)\n      - [Breadth First Search](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/Java-Implementation/BFS)\n      - [Depth First Search](https://github.com/Zannatul-Naim/Data-Structure/blob/main/Graph/Java-Implementation/DFS.java)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzannatul-naim%2Fdata-structure","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fzannatul-naim%2Fdata-structure","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzannatul-naim%2Fdata-structure/lists"}