Arithmetic Expression Binary Tree (AST to Code Translation)

From Algorithm Wiki
Revision as of 13:03, 15 February 2023 by Admin (talk | contribs)
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

AST to Code Translation - Arithmetic Expression Binary Tree - Time.png

Space Complexity graph

AST to Code Translation - Arithmetic Expression Binary Tree - Space.png

Pareto Decades graph

AST to Code Translation - Arithmetic Expression Binary Tree - Pareto Frontier.png

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Arithmetic_Expression_Binary_Tree&oldid=46180"