degenerate tree
[/dɪˈdʒɛnərət tri:/]
nounpl: degenerate trees
árvore degenerada
1. In computer science and data structures, a tree where nodes are organized in a highly unbalanced manner, often forming a linear chain-like structure with minimal branching, resulting in poor performance characteristics.
When inserting sorted data into a binary search tree without rebalancing, you may create a degenerate tree that performs like a linked list.
Ao inserir dados ordenados em uma árvore de busca binária sem reequilibramento, você pode criar uma árvore degenerada que funciona como uma lista ligada.
2. A tree structure where most or all internal nodes have only one child, causing the tree height to equal the number of nodes, defeating the purpose of tree-based organization.
A degenerate tree with n nodes can have a height of n, making search operations O(n) instead of O(log n).
Uma árvore degenerada com n nós pode ter uma altura de n, tornando operações de busca O(n) em vez de O(log n).
This is a specialized technical term primarily used in computer science, software engineering, and algorithms courses. It is not part of everyday language in either Brazilian Portuguese or English-speaking cultures. The term is important in academic and professional programming contexts where data structure efficiency is critical. Understanding degenerate trees is essential for computer science education and developing optimal software solutions.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →