CONCEITOS IMPORTANTES DE ESTRUTURA DE ÁRVORES:  binárias e binária balanceada(AVL)

Diogo Augusto Colombo; Santo Oliani Junior

doi:10.31510/infa.v20i1.1579

IMPORTANT TREE STRUCTURE CONCEPTS

binary and balanced binary (AVL)

Authors

Diogo Augusto Colombo Faculty of Technology of Taquaritinga (Fatec) https://orcid.org/0009-0009-3574-6519
Santo Oliani Junior Faculty of Technology of Taquaritinga (Fatec) https://orcid.org/0009-0001-2814-6912

DOI:

https://doi.org/10.31510/infa.v20i1.1579

Keywords:

Trees, Binary Trees, AVL Trees, Developers, Data Dtructure

Abstract

Currently, the labor market in the area of development demands qualified and specialized labor. Future developers should highlight the data structure methods, and, among them, one of the most important and that most makes those who know how to use it stand out is the tree structure, which includes the structure of binary and binary trees balanced (AVL). Thus, this article aims to highlight, analyze, explain and describe how the processes of using these structures are, based on the methodology of bibliographical research through books, magazines and articles, in order to highlight the differences between binary trees and AVL and demonstrate their similar factors. Finally, it is concluded that it is of paramount importance for a programmer to know and know how to implement.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

References

ASCENCIO, A. F. G.; ARAÚJO, G. S. DE. Estruturas de dados algoritmos analise da complexidade e implementações em java e C/C++,Perarson, 2010

DEVIREDDY, Pravallika. TREES- Binary Trees, Binary Search Trees, AVL Trees. [S. l.], 2021. Disponível em: https://medium.com/about-data-structures/trees-binary-trees-binary-search-trees-avl-trees-be0470eb533. Acesso em: 3 mar. 2023.

FEOFILOFF, P. Árvores binárias. 2002.Disponível em: <https://www.ime.usp.br/~pf/mac0122-2002/aulas/trees.html> Acesso em: 23 fev. 2023.

SOUZA, J. F.Árvores AVL: Estrutura de dados 2. 2009. disponível em: <https://www.ufjf.br/jairo_souza/files/2009/12/5-Indexa%C3%A7%C3%A3o-Árvore-AVL.pdf>Acesso em: 20 fev. 2023.

TENENBAUM, Aaron; LANGSAM, Yedidyah; AUGENSTEIN, Moshe. Estruturas de Dados Usando C. São Paulo: MAKRON Books do Brasil Editora Ltda., 1995.

VELSKII , Adelson. Fator de balanceamento = hdir - hesq. Arvores de AVL, 1962. Disponível em: https://www.ic.unicamp.br/en/~islene/mc202/aula17/avl.c. Acesso em: 09 mar. 2023.

Downloads

PDF (Português (Brasil))

Published

2023-06-30

How to Cite

COLOMBO, D. A.; OLIANI JUNIOR, S. . IMPORTANT TREE STRUCTURE CONCEPTS: binary and balanced binary (AVL). Revista Interface Tecnológica, [S. l.], v. 20, n. 1, p. 14–24, 2023. DOI: 10.31510/infa.v20i1.1579. Disponível em: https://revista.fatectq.edu.br/interfacetecnologica/article/view/1579. Acesso em: 11 may. 2024.

Download Citation

Issue

Vol. 20 No. 1 (2023): Interface Tecnológica

Section

Tecnologia em Informática

License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Os direitos autorais dos artigos publicados pertencem à revista Interface Tecnológica e seguem o padrão Creative Commons (CC BY 4.0), que permite o remixe, adaptação e criação de obras derivadas do original, mesmo para fins comerciais. As novas obras devem conter menção ao(s) autor(es) nos créditos.