{"id":19042215,"url":"https://github.com/mrmorais/tree","last_synced_at":"2026-05-08T21:30:16.022Z","repository":{"id":82401053,"uuid":"106553242","full_name":"mrmorais/tree","owner":"mrmorais","description":"Implementação de estruturas de dados em árvores","archived":false,"fork":false,"pushed_at":"2018-10-08T11:08:36.000Z","size":114,"stargazers_count":0,"open_issues_count":3,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-02T07:26:38.373Z","etag":null,"topics":["binary-search-tree","heap-tree","heapsort","tree"],"latest_commit_sha":null,"homepage":null,"language":"C++","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/mrmorais.png","metadata":{"files":{"readme":"README.md","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":"2017-10-11T12:47:48.000Z","updated_at":"2018-10-08T11:18:49.000Z","dependencies_parsed_at":"2023-06-25T22:19:25.290Z","dependency_job_id":null,"html_url":"https://github.com/mrmorais/tree","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/mrmorais%2Ftree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mrmorais%2Ftree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mrmorais%2Ftree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mrmorais%2Ftree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mrmorais","download_url":"https://codeload.github.com/mrmorais/tree/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240100511,"owners_count":19747683,"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":["binary-search-tree","heap-tree","heapsort","tree"],"created_at":"2024-11-08T22:35:47.766Z","updated_at":"2026-05-08T21:30:15.984Z","avatar_url":"https://github.com/mrmorais.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"### Tree\nby Maradona Morais\n\nImplementações em C++ de estruturas de dados organizadas em árvore e seus algoritmos.\n\n\n#### Features\n- Binary Tree \u0026 Binary Search Tree\n    - Parte do código foi reproduzida do livro \"Jumping into C++\" do [@alexallain](https://twitter.com/alexallain)\n- Heap Max\n- Heap Min (TO DO)\n\n#### Complexidades\nParte do arquivo [Big-O Cheat Sheet](https://www.packtpub.com/sites/default/files/downloads/4874OS_Appendix_Big_O_Cheat_Sheet.pdf)\n\n**Árvore binária**\n\n| Operação | Melhor caso | Pior caso |\n|----------|:----------:|:---------:|\n| Buscar | O(log(n)) | O(n) |\n| Inserir | O(log(n)) | O(n) |\n| Deletar | O(h) | O(n) |\n\nEm que *n* é a quantidade de elementos na árvore e *h* é a altura da mesma. Todos os casos médios foram O(log(n))\n\n**Heap Max**\n\n| Operação | Complexidade |\n|----------|:----------:|\n| Construir | O(n) |\n| Descer | O(log(n)) |\n| Deletar | O(log(n)) |\n| Subir | O(log(n)) |\n| Inserir | O(log(n)) |\n| Heap sort | O(nlog(n)) |\n\nInserção: Insere no final e sobe. \n\nDeleção: Substitui o último com o primeiro e desce o primeiro.\n\n#### Heap sort\n```\nprocedimento heapsort\n    arranjar(n) // O (n)\n    m \u003c- n\n    enquanto (m \u003e 1) faça // O (n)\n        troca(1, m)\n        m \u003c- m - 1\n        descer(1, m) // O(log n)\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmrmorais%2Ftree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmrmorais%2Ftree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmrmorais%2Ftree/lists"}