{"id":17662449,"url":"https://github.com/bilgehangecici/data-structures","last_synced_at":"2025-03-30T11:28:03.476Z","repository":{"id":110311292,"uuid":"228438372","full_name":"bilgehangecici/Data-Structures","owner":"bilgehangecici","description":"Highly important projects written in C for understanding basics and fundamentals of Data Structures.","archived":false,"fork":false,"pushed_at":"2020-01-14T13:01:29.000Z","size":635,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-05T13:25:16.999Z","etag":null,"topics":["algorithms","c","data-structures","heap","linked-list","tree-structure"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/bilgehangecici.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-12-16T17:22:21.000Z","updated_at":"2020-07-20T20:14:33.000Z","dependencies_parsed_at":"2023-05-04T00:47:37.691Z","dependency_job_id":null,"html_url":"https://github.com/bilgehangecici/Data-Structures","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/bilgehangecici%2FData-Structures","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bilgehangecici%2FData-Structures/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bilgehangecici%2FData-Structures/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bilgehangecici%2FData-Structures/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bilgehangecici","download_url":"https://codeload.github.com/bilgehangecici/Data-Structures/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246311786,"owners_count":20757200,"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":["algorithms","c","data-structures","heap","linked-list","tree-structure"],"created_at":"2024-10-23T18:22:31.645Z","updated_at":"2025-03-30T11:28:03.454Z","avatar_url":"https://github.com/bilgehangecici.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Data Structures\n  - This repository includes Data Structures projects.\n  - For further informations about projects please visit Project Documentation section.\n  \n   # Project-1\n   # Text representation with higher-order paths.\n   * This project aims to represent these higher-order paths by using \n   Linked-Lists. Consequently, this project is a programming assignment in C, which aims to build an algorithm based on linked-lists that      will build an efficient representation of documents.\n   \n   # Project-2\n   # Binary Search Tree topologies.\n   * This project is a programming assignment in C which aims at developing an algorithm that\n     builds a binary search tree (BST) from a given sequence and attemps to find other sequences\n     that yield the same BST topology.\n     \n   # Project-3\n   # Priority Queue in a Preemptive Scheduling System via Binomial Heaps.\n   * This project aims that using binomial heaps to implement a priority queue in a preemptive scheduling system.  A preemptive scheduling    mechanism, shown in Fig. 1, operates as follows:\n   \n   Priority Queue in a Preemptive Scheduling System:\n   \n   ![Priority Queue in a Preemptive Scheduling System](https://drive.google.com/uc?export=view\u0026id=11zespD-aFab0DwY9UaEyjbwNVvktduSb)\n   \n   \n   \n   \n   \n   \n                                             \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbilgehangecici%2Fdata-structures","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbilgehangecici%2Fdata-structures","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbilgehangecici%2Fdata-structures/lists"}