Skip to content

A C++ program that converts expressions from prefix to infix notation and evaluates them.

Notifications You must be signed in to change notification settings

ssmahavadi/expression-tree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

13 Commits
 
 
 
 
 
 

Repository files navigation

Expression Tree

This project was completed as my IB Computer Science HL internal assessment; it was completed over a period of nearly four months, spanning from mid-October of 2020 to early January of 2021.

The program itself creates an 'expression tree' that converts expressions from prefix to infix notation and accurately evaluates them.

The program is written entirely in C++. Some of the fundamental concepts of programming that are implemented in the program inlclude pointers, switch case, try and catch errors, object-oriented programming (classes, objects, encapsulation, abstraction, etc), and more. For a more detailed explanation of the utilization of such concepts in the program, you can read my internal assessment (https://bit.ly/etree-ia); the paper will also reveal my creative process in completing this program.

Here's the link to a video demonstrating the program's functions: https://bit.ly/etree-video.

About

A C++ program that converts expressions from prefix to infix notation and evaluates them.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages