tree recursion
[triː rɪˈkɜːrʒən]
nounpl: tree recursions
recursão em árvore
1. A recursive algorithm or function that calls itself multiple times within a single function call, creating a tree-like structure of function calls where each call may spawn multiple branches of subsequent calls
The Fibonacci function is a classic example of tree recursion, where each call spawns two additional recursive calls.
A função de Fibonacci é um exemplo clássico de recursão em árvore, onde cada chamada gera duas chamadas recursivas adicionais.
2. In computer science, a pattern of computation that explores multiple branches simultaneously, often used in problems involving searching, parsing, or dynamic programming
Tree recursion can be inefficient without memoization, as it recalculates the same subproblems multiple times.
A recursão em árvore pode ser ineficiente sem memorização, pois recalcula o mesmo subproblema várias vezes.
Tree recursion is a fundamental concept taught in computer science courses in both Brazil and the USA. The term is primarily used in technical and academic contexts. In Brazilian universities, this concept is often introduced when teaching data structures and algorithms, with Fibonacci and tree traversal problems being common pedagogical examples.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →