Arithmetic Expression Binary Tree (AST to Code Translation)
Jump to navigation
Jump to search
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
Space Complexity Graph
Error creating thumbnail: Unable to save thumbnail to destination
Time-Space Tradeoff
Error creating thumbnail: Unable to save thumbnail to destination