AVL tree
[/ˌeɪ viː ˈɛl tri/]
nounpl: AVL trees
árvore AVL
1. A self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one, ensuring O(log n) time complexity for search, insertion, and deletion operations.
The AVL tree automatically rebalances itself after each insertion to maintain optimal search performance.
A árvore AVL se reequilibra automaticamente após cada inserção para manter o desempenho ideal de busca.
2. A data structure named after its inventors Adelson-Velsky and Landis, used in computer science for efficient data management.
When implementing a database index, developers often choose an AVL tree for its guaranteed logarithmic operations.
Ao implementar um índice de banco de dados, os desenvolvedores frequentemente escolhem uma árvore AVL por suas operações logarítmicas garantidas.
AVL tree is a fundamental concept in computer science education and software engineering globally. It was invented by Soviet computer scientists Georgy Adelson-Velsky and Evgenii Landis in 1962. The term is used identically in English and Portuguese technical contexts, making it a true cognate in the field of computer science. It appears frequently in algorithm textbooks, coding interviews, and advanced data structures courses in both Brazilian and Portuguese universities.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →