binary search tree
[/ˈbaɪ.nər.i ˈsɜːtʃ triː/]
nounpl: binary search trees
árvore de busca binária
1. A data structure in computer science where each node has at most two child nodes (left and right), and for each node, all values in the left subtree are smaller and all values in the right subtree are larger, enabling efficient searching, insertion, and deletion operations.
A binary search tree is commonly used to implement efficient lookup operations in databases.
Uma árvore de busca binária é comumente usada para implementar operações de busca eficientes em bancos de dados.
2. A tree data structure that maintains a sorted order of elements while allowing logarithmic time complexity for basic operations.
The algorithm uses a binary search tree to store and retrieve customer records quickly.
O algoritmo usa uma árvore de busca binária para armazenar e recuperar registros de clientes rapidamente.
This is a technical term primarily used in computer science education and software development communities. It is identical across English-speaking countries and Brazilian Portuguese, though Portugal uses 'pesquisa' instead of 'busca'. The term is part of the universal language of computer science and data structures, used in algorithm courses, technical interviews, and professional programming contexts worldwide.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →