Recursive vs Postorder - What's the difference?
recursive | postorder |
drawing upon itself, referring back.
(mathematics, not comparable) of an expression, each term of which is determined by applying a formula to preceding terms
(computing, not comparable) of a program or function that calls itself
(computing theory, not comparable, of a function) which can be computed by a theoretical model of a computer, in a finite amount of time
(computing theory, not comparable, of a set) whose characteristic function is recursive (4)
(computing theory) Of a tree traversal, recursively visiting the left and right subtrees before the root.
As adjectives the difference between recursive and postorder
is that recursive is drawing upon itself, referring back while postorder is (computing theory) of a tree traversal, recursively visiting the left and right subtrees before the root.recursive
English
Adjective
{{examples-right, sense=function, The factorial function - : : where n is any natural number greater than 0}} (en adjective)- The recursive nature of stories which borrow from each other
