Skip to content
#

expression-tree-builder

Here are 9 public repositories matching this topic...

Postfix to Infix converter built on binary Expression Tree. To convert the tree to Infix expression the inorder tree traversal is applied. Implemented in Java with GUI

  • Updated Feb 23, 2024
  • Java

C++ library for perprocessing, building, and evaluating expression trees with symbolic differentiation, numerical integration (Simpson’s 1/3 & 3/8), simplification, variable substitution, and vector calculus tools (gradient, divergence, curl, Laplacian). Templated for any datatype and complex-number support, with extensible functions & constants

  • Updated Mar 24, 2026
  • C++

Improve this page

Add a description, image, and links to the expression-tree-builder topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the expression-tree-builder topic, visit your repo's landing page and select "manage topics."

Learn more