Arithmetic Expression Binary Tree: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 24: | Line 24: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:AST to Code Translation - Arithmetic Expression Binary Tree - Time.png|1000px]] | [[File:AST to Code Translation - Arithmetic Expression Binary Tree - Time.png|1000px]] | ||
Latest revision as of 09:10, 28 April 2023
Description
Translate a given arithmetic expression binary tree into machine-readable code that uses as few registers as possible.
Related Problems
Related: AST to Code Translation
Parameters
$n$: number of nodes in the tree
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Sethi–Ullman Algorithm | 1970 | $O(n)$ | $O({1})$ | Exact | Deterministic | Time |
Time Complexity Graph
Error creating thumbnail: Unable to save thumbnail to destination