Home >  Term: recursion tree
recursion tree

A method to analyze the complexity of an algorithm by diagramming the recursive function calls. Formal Definition: A recursion tree T(p) of degree p is either (i) null or (ii) has p children which are recursion trees.

0 0

Creator

  • GeorgeV
  •  (Gold) 1123 points
  • 100% positive feedback
© 2024 CSOFT International, Ltd.