{"id":23113929,"url":"https://github.com/rationalcrafter/avl_tree","last_synced_at":"2025-07-26T07:11:52.738Z","repository":{"id":265107289,"uuid":"854709871","full_name":"RationalCrafter/avl_tree","owner":"RationalCrafter","description":"Simple implementation of an AVL tree set data structure","archived":false,"fork":false,"pushed_at":"2024-09-09T16:58:53.000Z","size":13,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-04T00:28:48.553Z","etag":null,"topics":["algo","c","data-structures"],"latest_commit_sha":null,"homepage":"","language":null,"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/RationalCrafter.png","metadata":{"files":{"readme":"README","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":"2024-09-09T16:38:15.000Z","updated_at":"2024-10-29T18:59:13.000Z","dependencies_parsed_at":"2024-11-27T17:40:37.115Z","dependency_job_id":"2da01556-55c6-43fb-a8a9-9a47b803562b","html_url":"https://github.com/RationalCrafter/avl_tree","commit_stats":null,"previous_names":["rationalcrafter/avl_tree"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/RationalCrafter/avl_tree","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RationalCrafter%2Favl_tree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RationalCrafter%2Favl_tree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RationalCrafter%2Favl_tree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RationalCrafter%2Favl_tree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/RationalCrafter","download_url":"https://codeload.github.com/RationalCrafter/avl_tree/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RationalCrafter%2Favl_tree/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267133958,"owners_count":24040789,"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","status":"online","status_checked_at":"2025-07-26T02:00:08.937Z","response_time":62,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["algo","c","data-structures"],"created_at":"2024-12-17T03:16:53.154Z","updated_at":"2025-07-26T07:11:52.667Z","avatar_url":"https://github.com/RationalCrafter.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"An AVL Tree is a self-balancing binary search tree where the difference between the heights of the \nleft and right subtrees cannot be made more than one for all the nodes. If at any point the height \nbecomes more than one, the tree balances itself through rotations.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frationalcrafter%2Favl_tree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frationalcrafter%2Favl_tree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frationalcrafter%2Favl_tree/lists"}