{"id":13340972,"url":"https://github.com/mstrlc/ial-homework-2","last_synced_at":"2025-03-11T19:31:00.902Z","repository":{"id":127723958,"uuid":"558415344","full_name":"mstrlc/ial-homework-2","owner":"mstrlc","description":"FIT VUT – IAL – binary tree and hashtable homework","archived":false,"fork":false,"pushed_at":"2023-02-20T19:48:54.000Z","size":10,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-10-24T06:30:47.762Z","etag":null,"topics":["algorithms","binary-tree","btree","fit","hashtable","ial","vut"],"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/mstrlc.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-10-27T14:00:30.000Z","updated_at":"2023-02-20T19:49:18.000Z","dependencies_parsed_at":null,"dependency_job_id":"ea3a2b09-1eb9-41d3-82fa-2758e8ff29f7","html_url":"https://github.com/mstrlc/ial-homework-2","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/mstrlc%2Fial-homework-2","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mstrlc%2Fial-homework-2/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mstrlc%2Fial-homework-2/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mstrlc%2Fial-homework-2/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mstrlc","download_url":"https://codeload.github.com/mstrlc/ial-homework-2/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243098699,"owners_count":20236075,"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","binary-tree","btree","fit","hashtable","ial","vut"],"created_at":"2024-07-29T19:25:07.247Z","updated_at":"2025-03-11T19:31:00.897Z","avatar_url":"https://github.com/mstrlc.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"### FIT VUT – IAL – 2nd homework\n**10/10 points**\n\nImplementation of a hashtable and iterative \u0026 recursive versions of a binary tree.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmstrlc%2Fial-homework-2","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmstrlc%2Fial-homework-2","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmstrlc%2Fial-homework-2/lists"}