{"id":25732150,"url":"https://github.com/howprogrammingworks/trees","last_synced_at":"2025-05-07T18:43:18.793Z","repository":{"id":11779394,"uuid":"70535554","full_name":"HowProgrammingWorks/Trees","owner":"HowProgrammingWorks","description":"Tree node with 5 pointers","archived":false,"fork":false,"pushed_at":"2024-12-08T21:12:05.000Z","size":31,"stargazers_count":3,"open_issues_count":6,"forks_count":13,"subscribers_count":22,"default_branch":"master","last_synced_at":"2024-12-08T22:20:36.841Z","etag":null,"topics":["tree"],"latest_commit_sha":null,"homepage":"https://www.youtube.com/TimurShemsedinov","language":"JavaScript","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/HowProgrammingWorks.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}},"created_at":"2016-10-10T22:55:54.000Z","updated_at":"2024-12-08T21:12:08.000Z","dependencies_parsed_at":"2022-08-24T13:21:28.063Z","dependency_job_id":null,"html_url":"https://github.com/HowProgrammingWorks/Trees","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/HowProgrammingWorks%2FTrees","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HowProgrammingWorks%2FTrees/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HowProgrammingWorks%2FTrees/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HowProgrammingWorks%2FTrees/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/HowProgrammingWorks","download_url":"https://codeload.github.com/HowProgrammingWorks/Trees/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240788735,"owners_count":19857691,"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":["tree"],"created_at":"2025-02-26T03:39:44.317Z","updated_at":"2025-02-26T03:39:44.970Z","avatar_url":"https://github.com/HowProgrammingWorks.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Tree with 5 pointers and Binary tree\n\nЗадания:\n- Реализовать сбалансированное бинарное дерево не на массивах (как в примерах),\nа на объектах\n  - Сделать повороты\n  - Реализовать оба варианта, как балансировку целого дерева, так и балансировку\n  при вставках новых ключей\n- Реализовать 5-связное дерево на массивах или типизированных массивах,\nа не на объектах (как в примерах)\n- Покрыть тестами примеры дерева на массивах и объектах\n- Сравнить по производительности дерево на массивах и объектах\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhowprogrammingworks%2Ftrees","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhowprogrammingworks%2Ftrees","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhowprogrammingworks%2Ftrees/lists"}