Quick Links
Summary:
Allows the user to create a binary search tree of Term objects
-
(coefficients and exponents i.e. 2x^3)
Inputs:
-
A)dd - add a Term to the tree
-
R)emove - remove a Term from the tree (if it exists)
-
C)hange - change the exponent of a term in the tree
-
P)rint - prints all Terms in the tree
-
T)ree Print - prints all Terms in the tree in pseudo tree structure
-
Q)uit - quits the program
-
Hit the play button on top of the window for interactive mode
-
Input "./main < preset_input" to run demo file. (Can copy and paste with right click)
Binary Tree Class & Application
Challenge:
-
Update a binary search tree to handle duplicate data.
-
Implement print in descending order.
-
Allow the user to modify the contents of the tree (adjusting tree arrangement if the order is disrupted).
C++
Language:
More Info:
Full files and usage descriptions available at linked site.
Generated with Doxygen.