Sethi–Ullman Algorithm (Arithmetic Expression Binary Tree AST to Code Translation)
Jump to navigation
Jump to search
Time Complexity
$O(n)$
Space Complexity
$O({1})$ words
(Derived: Only uses in-situ updates to the input tree, no auxiliary data structures)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1970