Sethi–Ullman Algorithm (Arithmetic Expression Binary Tree AST to Code Translation)

From Algorithm Wiki
Revision as of 12:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://dl.acm.org/doi/10.1145/321607.321620")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Reference

https://dl.acm.org/doi/10.1145/321607.321620

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Sethi–Ullman_Algorithm_(Arithmetic_Expression_Binary_Tree_AST_to_Code_Translation)&oldid=45463"