{"id":16199890,"url":"https://github.com/bialger/bst","last_synced_at":"2026-02-25T18:03:24.832Z","repository":{"id":247080271,"uuid":"824968902","full_name":"bialger/bst","owner":"bialger","description":"C++ library that implements an Associative Container with Binary Search Tree logics. ITMO SE'27 first cource programming laboratory work.","archived":false,"fork":false,"pushed_at":"2024-08-14T10:40:25.000Z","size":143,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-29T11:04:00.949Z","etag":null,"topics":["algorithm","algorithms","stl-container","stl-containers","student-project"],"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/bialger.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":"2024-07-06T12:32:31.000Z","updated_at":"2024-08-14T10:40:29.000Z","dependencies_parsed_at":"2024-11-03T09:23:42.601Z","dependency_job_id":"2c284b7b-c1d8-4dc4-ba40-7fde027d6034","html_url":"https://github.com/bialger/bst","commit_stats":null,"previous_names":["bialger/bst"],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/bialger/bst","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bialger%2Fbst","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bialger%2Fbst/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bialger%2Fbst/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bialger%2Fbst/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bialger","download_url":"https://codeload.github.com/bialger/bst/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bialger%2Fbst/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29833683,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-25T17:57:15.019Z","status":"ssl_error","status_checked_at":"2026-02-25T17:56:11.472Z","response_time":61,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["algorithm","algorithms","stl-container","stl-containers","student-project"],"created_at":"2024-10-10T09:28:37.232Z","updated_at":"2026-02-25T18:03:24.799Z","avatar_url":"https://github.com/bialger.png","language":"C++","readme":"# Лабораторная работа 8\n\nБинарное дерево поиска. Шаблоны. STL.\n\n## Задача\n\nРеализовать три STL-совместимых контейнера для [BinarySearchTree](https://en.wikipedia.org/wiki/Binary_search_tree), реализующие различные [способы обхода дерева (in-, pre-, post-order)](https://en.wikipedia.org/wiki/Tree_traversal) через итератор.\n\n## Требования\n\nКонтейнер должен предоставлять из себя шаблон, праметрезируемый типом хранимых объетов, оператором сравнения и аллокатором, а так же удовлетворять следующим требованиям к stl - совместимым контейнерам:\n\n  - [контейнера](https://en.cppreference.com/w/cpp/named_req/Container)\n  - [ассоциативный контейнера](https://en.cppreference.com/w/cpp/named_req/AssociativeContainer)\n  - [контейнера с обратным итератором](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer)\n  - [контейнера поддерживающие аллокатор](https://en.cppreference.com/w/cpp/named_req/AllocatorAwareContainer)\n  - [oбладать двунаправленным итератом](https://en.cppreference.com/w/cpp/named_req/BidirectionalIterator)\n\nСпособ обхода дерева должен быть реализован через итератор, те оператор \"++\" должен приводить к перемещению итератора к следующему элементу в дереве, согласно правилу обхода.\n\n## Тесты\n\nВсе вышеуказанные требования должны быть покрыты тестами, с помощью фреймворка [Google Test](http://google.github.io/googletest).\n\nТесты также являются частью задания, поэтому покрытие будет влиять на максимальный балл.\n\n## Ограничения\n\n- Запрещено использовать стандартные контейнеры\n\n## NB\n\nПодумайте над тем как не делать 3 разных контейнера, а воспользоваться [Tag Dispatch Idiom](https://en.wikibooks.org/wiki/More_C%2B%2B_Idioms/Tag_Dispatching)\n\n## Deadline\n\n1. 12.03.24. 0.8\n2. 19.03.24. 0.65\n3. 26.03.24. 0.5\n\nМаксимальное количество баллов - 15\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbialger%2Fbst","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbialger%2Fbst","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbialger%2Fbst/lists"}