Expression trees exercises in C Programming in C

• LEVEL 3 Recursive function Recursion Binary trees Boolean expression: A Boolean expression is represented as a binary tree of strings (BT) in which internal nodes contain the logical connectors $$\texttt{AND}$$, $$\texttt{OR}$$ and $$\texttt{NOT}$$, and leaves contain strings representing Boolean variables. Ex: the ex...
• LEVEL 3 Recursive function Recursion Binary trees Build a tree from preorder traversal: Write a function that given an expression tree with the following properties: leaves are represented with * and internal node with +. each node has either 0 or 2 children. Given the preorder traversal of a tree, construct the tree. Example: for the f...
• LEVEL 3 String Stack Postfix Expression Evaluation using Expression trees: Your job is to read a postfix expression, convert it into an expression tree and then evaluate the tree. The input expression is a string composed of digits (0 till 9) and operators (/, *, -, +, ^ (denotes exponentiation) and # (denotes unary minus)...

Back to the list of exercises