{"id":26513575,"url":"https://github.com/ankush-003/data-structures-using-c","last_synced_at":"2025-03-21T04:29:00.193Z","repository":{"id":62272285,"uuid":"537187405","full_name":"ankush-003/Data-Structures-Using-C","owner":"ankush-003","description":"Learning Data Structures using C Language","archived":false,"fork":false,"pushed_at":"2022-12-24T14:31:48.000Z","size":2175,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-04-15T04:07:01.523Z","etag":null,"topics":["c","data-structures"],"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/ankush-003.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-09-15T19:59:57.000Z","updated_at":"2024-01-12T18:38:01.000Z","dependencies_parsed_at":"2023-01-30T21:00:40.242Z","dependency_job_id":null,"html_url":"https://github.com/ankush-003/Data-Structures-Using-C","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/ankush-003%2FData-Structures-Using-C","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ankush-003%2FData-Structures-Using-C/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ankush-003%2FData-Structures-Using-C/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ankush-003%2FData-Structures-Using-C/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ankush-003","download_url":"https://codeload.github.com/ankush-003/Data-Structures-Using-C/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244736750,"owners_count":20501536,"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":["c","data-structures"],"created_at":"2025-03-21T04:28:59.707Z","updated_at":"2025-03-21T04:29:00.184Z","avatar_url":"https://github.com/ankush-003.png","language":"C","readme":"# **Data-Structures-Using-C**\n### _Learning Data Structures using C Language_\n---\nThis repository includes the following Modules:\n\n* Unit-1 : Recursion , Static and Dynamic Memory Allocation\n\n    Linked List:  Doubly Linked List, Circular Linked List – Single and Double\n\n* Unit-2: Stacks and Queues\n\n    Stacks: Basic structure of a Stack, Implementation of a Stack using Arrays \u0026 Linked list. Applications of Stack: Function execution, Nested functions, Recursion: Tower of Hanoi. Conversion \u0026 Evaluation of an expression: Infix to postfix, Infix to prefix, Evaluation of an     Expression, Matching of Parenthesis. Queues \u0026 DEQUE: Basic Structure of a Simple Queue, Circular Queue, Priority Queue, DEQUE and its implementation using Arrays and Linked List. Applications of Queue:  Case Study – Josephus problem, CPU scheduling- Implementation using queue (simple /circular).\n\n* Unit-3: Trees and Heaps\n\n    General: N-ary trees, Binary Trees, Binary Search Trees and Forest: definition, properties, conversion of an N-ary tree and a Forest to a binary tree.  Implementation of BST using  arrays and dynamic allocation : Insertion and deletion operations, Traversal of trees: Preorder, Inorder and Postorder. Implementation of binary expression tree, Threaded binary search tree and its implementation. Heap: Implementation using arrays. Implementation of Priority Queue using heap - min and max heap. Applications of Trees and Heaps: Implementation of a dictionary / decision tree (Words with their meanings).\n---\nFor Further reference:\n\n### [Geek For Geeks](https://www.geeksforgeeks.org/data-structures/)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fankush-003%2Fdata-structures-using-c","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fankush-003%2Fdata-structures-using-c","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fankush-003%2Fdata-structures-using-c/lists"}