Clik here to view.
Arduino: Valuation calculator of infix mathematical expressions.
This project refers to an Arduino sketch that implements a calculator which valuates infix mathematical expressions using appropriate algorithms and data structures. The mathematical expressions are...
View ArticleClik here to view.
Arduino: A library for implementing a generic, dynamic stack (array version).
This project refers to an Arduino library implementing a generic, dynamic stack (array version). The data structure is implemented as a class in C++. For more information, you can get the project...
View ArticleClik here to view.
Arduino: A library for implementing a generic, dynamic stack (linked list...
This project refers to an Arduino library implementing a generic, dynamic stack (linked list version). The data structure is implemented as a class in C++. For more information, you can get the project...
View ArticleClik here to view.
Implementation of algorithm for calculating a postfix expression.
The following program reads any postfix expression that includes integer multiplication and addition, evaluates the expression and displays the final result on the screen. The program stores the...
View ArticleClik here to view.
Implementation of algorithm for converting an expression from infix to...
The following program converts an expression from infix to postfix notation. The conversion is carried out with the help of a stack. For example, to turn the expression (A + B) into the postfix form A...
View ArticleClik here to view.
Implementation of algorithms (without recursion) for preorder & level-order...
The iterative (non-recursive) function preorderTreeTraverse() can perform preorder traversing of a binary tree with the help of a stack that can hold pointers to nodes of the tree. Also, the iterative...
View Article
