{"id":26544940,"url":"https://github.com/couragebforedth/avl-tree","last_synced_at":"2025-07-09T23:37:45.794Z","repository":{"id":192953791,"uuid":"98364813","full_name":"couragebforedth/avl-tree","owner":"couragebforedth","description":"An implementation of an AVL tree that allows inserting, deleting, printing, and sorting nodes with diagrams and unit test cases for every possible operation.","archived":false,"fork":false,"pushed_at":"2023-09-06T03:49:31.000Z","size":6838,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-03-22T04:15:09.930Z","etag":null,"topics":["algorithms","avl-tree","cplusplus","data-structures","diagrams","unit-tests"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/couragebforedth.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}},"created_at":"2017-07-26T01:22:56.000Z","updated_at":"2024-07-29T05:15:51.000Z","dependencies_parsed_at":"2023-09-06T04:57:31.305Z","dependency_job_id":null,"html_url":"https://github.com/couragebforedth/avl-tree","commit_stats":null,"previous_names":["adaptordie247/avl-tree","wwwdanielg/avl-tree","danielstephengilbert/avl-tree","couragebforedth/avl-tree"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/couragebforedth/avl-tree","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/couragebforedth%2Favl-tree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/couragebforedth%2Favl-tree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/couragebforedth%2Favl-tree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/couragebforedth%2Favl-tree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/couragebforedth","download_url":"https://codeload.github.com/couragebforedth/avl-tree/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/couragebforedth%2Favl-tree/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":264505353,"owners_count":23618927,"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","avl-tree","cplusplus","data-structures","diagrams","unit-tests"],"created_at":"2025-03-22T04:14:59.098Z","updated_at":"2025-07-09T23:37:45.613Z","avatar_url":"https://github.com/couragebforedth.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# AVL Tree #\n\nAuthor: Daniel Gilbert (AdaptOrDie247)\n\nAn implementation of an AVL tree that allows inserting, deleting, printing, and sorting nodes with diagrams and unit test cases for every possible operation.\n\n### Build Instructions for Linux/Cygwin ###\n\n\tmkdir build\n\tcd build\n\tcmake ..\n\tmake\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcouragebforedth%2Favl-tree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcouragebforedth%2Favl-tree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcouragebforedth%2Favl-tree/lists"}