language is C++ This is a menu-driven program. One of the menu items is to create an expression tree. The input expression is provided by user. (You are free to limit the expressions received from the user, to be without parentheses, if you find that difficult) In addition, provide menu options for the following: a) Print expression from a given tree, in prefix notation b) Print expression from a given tree, in infix notation c) Calculate and print the result of the created Expression Tre

language is C++ This is a menu-driven program. One of the menu items is to create an expression tree. The input expression is provided by user. (You are free to limit the expressions received from the user, to be without parentheses, if you find that difficult) In addition, provide menu options for the following: a) Print expression from a given tree, in prefix notation b) Print expression from a given tree, in infix notation c) Calculate and print the result of the created Expression Tre

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

Explore the concept of Binary Expression Trees and their role in evaluating mathematical expressions. How can you construct and evaluate expressions using binary expression trees?
Given a string containing opening and closing braces, check if it represents a balanced expression or not using the stack. Example: [ () {()} {{()}} ] it should give no error Example: { () (}}] , [(}] it should give an error
In Python 3 You can create a more interesting and realistic-looking tree by randomizing the angle the turtle turns. Rather than always using a 30 degree angle, select an angle between 15 and 45 degrees. randomizing how much the branches shrink each time you make a recursive call. Instead of always subtracting 15, try subtracting a random amount between 5 and 25. add color to the tree by making the large branches brown, and the small branches green. Choose a threshold value (or use the existing value 5) for the length of the trunk and set the color accordingly. Here is a simple version that creates a "dot" in the base case (for a leaf). Your program output does not have to be the same. (Check picture) import turtle def tree(t, trunkLength):if trunkLength < 5: #check for base casereturnelse:t.forward(trunkLength)t.right(30)tree(t, trunkLength - 15)t.left(60)tree(t, trunkLength - 15)t.right(30)t.backward(trunkLength) import turtlet =…
In Python 3 You can create a more interesting and realistic-looking tree by randomizing the angle the turtle turns. Rather than always using a 30 degree angle, select an angle between 15 and 45 degrees. randomizing how much the branches shrink each time you make a recursive call. Instead of always subtracting 15, try subtracting a random amount between 5 and 25. add color to the tree by making the large branches brown, and the small branches green. Choose a threshold value (or use the existing value 5) for the length of the trunk and set the color accordingly. Here is a simple version that creates a "dot" in the base case (for a leaf). Your program output does have to be similar. Thank You.
Create a program in C-Language that will accept three numbers. It will compute for thesum, product, and average of the tree numbers. The sum, product and average will bedisplayed as shown in the sample output below. Take note that the average should havetwo decimal places for the display.Sample screen output:Input First Number:Input Second Number:Input Third Number:The Sum is _____The Product is _____(2 decimal places) The Average is _____
Computer Science Method to convert a binary search tree in a string in C? NEED TO BE IN C PROGRAMMING You have to create a string that contains the elements of binary search tree. It also has to be in-order traversal.
write a code using binary tree linked list data structures. In quiz game, questions are chosen in such a a way that they cover all fields of a typical quiz contest. The user’s general knowledge is tested with quiz questions regarding science, technology, movies, sports, general health, geography and many more. Quiz Game Project Introduction: Functions of projects and below is some function used in project:- Edit score--adds the prize won to the previous one upon giving the right answer to a question Help-- menu with game summary and rules Show record--shows the highest cash prize won by a particular user Show score--to view the highest score Reset score--to reset the highest score/ default In quiz game project, we can store the user’s name, view the highest score secured by a user, and even reset the score. The game ends when the user’s cash prize piles up to…
public static int[] goodResize(int[] list, int newSize) { assert list != null && newSize >= 0 : "failed precondition"; int[] result = new int[newSize]; int limit = Math.min(list.length, newSize); for(int i = 0; i < limit; i++) { result[i] = list[i]; } return result; } **Note: Software testing & quality assurance Question: Create a control flow graph based on the coding above and find all these paths: Statement coverage Branch coverage Predicate coverage
Help on the following question A co-worker emails you and said she developed a recursive version for doing search in a binary search tree. Here’s the code for the function: public boolean searchRecursive(Node current, int searchValue) { if (current == null) return false; if (current.data == searchValue) return true; else if (current.data > searchValue) return searchRecursive(current.right, searchValue); else return searchRecursive(current.left, searchValue); } She’s not sure if there is an error or not because the code does compile. You analyze the code and respond to her as follows: Draw a picture of what a binary search tree would look like after inserting values of 10, 15, 18, 13, 5, 1, and 8 in that order Next, if you believe there is no error with the code, then show her how the code executes when searching for different values using the tree you made in step 1) Or, if you believe there is…
Python 3 You can create a more interesting and realistic looking tree by a) randomizing the angle the turtle turns. Rather than always using a 30 degree angle, select an angle between 15 and 45 degrees. b) randomizing how much the branches shrink each time you make a recursive call. Instead of always subtracting 15, try subtracting a random amount between 5 and 25. c) add color to the tree by making the large branches brown, and the small branches green. Choose a threshold value (or use the existing value 5) for the length of the trunk and set the color accordingly. Here is a simple version that creates a "dot" in the base case (for a leaf). Your program output does not have to be the same. Check the attached picture and the code bellow. import turtle def tree(t, trunkLength):if trunkLength < 5: #check for base casereturnelse:t.forward(trunkLength)t.right(30)tree(t, trunkLength - 15)t.left(60)tree(t, trunkLength -…
The following function converts a postfix expression to an infix expression assuming the expression can only contain unsigned integer numbers and ‘+’ and ‘-’ operators. 1. public static String convert(String postfix) { 2. String operand1, operand2, infix; 3. Stack<String> s = new AStack<String>; 4. int i = 0; 5. while(i < postfix.length) { 6. char nextc = postfix.charAt(i); 7. if ((nextc == '+')||(nextc == '-') { 8. operand2 = s.pop(); operand1 = s.pop(); 9. infix = '(' + operand1 + nextc + operand2 + ')'; 10. s.push(infix); i++; 11. } 12. else if (Character.isDigit(nextc)){ 13. int start = i; 14. while(Character.isDigit(postfix.charAt(i)) i++; 15. infix = postfix.substring(start,i); 16. s.push(infix); 17. } 18. else i++; 19. } 20 return s.pop(); 21. } a) Rewrite only the lines of code that need to be changed so…
Java Programming Exercise 2 Another co-worker emails you and said she developed a recursive version for doing search in a binary search tree. Here’s the code for the function: public boolean searchRecursive(Node current, int searchValue) { if (current.data == searchValue) return true; else if (current == null) return false; else if (current.data > searchValue) return searchRecursive(current.left, searchValue); else return searchRecursive(current.right, searchValue); } She says that she “keeps getting an error” but unfortunately did not say if it was a compile error or a run-time error (or both). You analyze the code and see there is indeed an error and so you reply with the following: Draw a picture of what a binary search tree would look like after inserting values of 5, 10, 8, 15, 4, 2, and 3 in that order Next, tell her why she gets either a compile time error or run-time error (or both) and…