{"id":22612233,"url":"https://github.com/ivanbgd/self-balancing-binary-search-trees","last_synced_at":"2025-08-17T03:35:36.292Z","repository":{"id":139677051,"uuid":"110496493","full_name":"ivanbgd/Self-Balancing-Binary-Search-Trees","owner":"ivanbgd","description":"Self-Balancing Binary Search Trees (AVL, Splay), with examples","archived":false,"fork":false,"pushed_at":"2017-11-13T05:12:42.000Z","size":52,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-03-28T23:45:52.764Z","etag":null,"topics":["avl","avl-tree","avltree","binary-search-tree","bst","splay","splay-trees","splaytrees"],"latest_commit_sha":null,"homepage":null,"language":"Python","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/ivanbgd.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":"2017-11-13T03:37:46.000Z","updated_at":"2017-11-13T03:58:19.000Z","dependencies_parsed_at":null,"dependency_job_id":"97e99f6d-bcf0-4987-914a-30eeca3dc2e4","html_url":"https://github.com/ivanbgd/Self-Balancing-Binary-Search-Trees","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ivanbgd/Self-Balancing-Binary-Search-Trees","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanbgd%2FSelf-Balancing-Binary-Search-Trees","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanbgd%2FSelf-Balancing-Binary-Search-Trees/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanbgd%2FSelf-Balancing-Binary-Search-Trees/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanbgd%2FSelf-Balancing-Binary-Search-Trees/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ivanbgd","download_url":"https://codeload.github.com/ivanbgd/Self-Balancing-Binary-Search-Trees/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanbgd%2FSelf-Balancing-Binary-Search-Trees/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":270803378,"owners_count":24648685,"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-08-17T02:00:09.016Z","response_time":129,"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":["avl","avl-tree","avltree","binary-search-tree","bst","splay","splay-trees","splaytrees"],"created_at":"2024-12-08T17:11:30.503Z","updated_at":"2025-08-17T03:35:36.258Z","avatar_url":"https://github.com/ivanbgd.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Self-Balancing-Binary-Search-Trees\nSelf-Balancing Binary Search Trees (AVL, Splay), with examples\n\nRegular, non-balancing, BSTs are also included.\n\nAvailable operations on trees include traversals (in-order, pre-order, post-order, level-order, both recursive and iterative), search, finding minimum and maximum values, range search (which returns a list of nodes with keys between two values), insertion, deletion, merging two trees, splitting a tree in two trees, order statistic (returning the k-th smallest element in a tree), computing rank of a node, and printing a tree.\n\nColor flips are a way of representing arrays by using BSTs, for improved speed of operation.\nBy using AVL trees like here (self balancing trees in general), we keep the maximum height of a tree at O(log n), so all operations on the array take at most O(log n) time.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fivanbgd%2Fself-balancing-binary-search-trees","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fivanbgd%2Fself-balancing-binary-search-trees","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fivanbgd%2Fself-balancing-binary-search-trees/lists"}