Problem: Write a C++ program that takes as input, a fully parenthesized, arithmetic expression and converts it to a binary expression tree. You program should display the tree in some way and also print the value associated with the root. Example: (3 + ((5+9) *2)) 3 5 9 2

Problem: Write a C++ program that takes as input, a fully parenthesized, arithmetic expression and converts it to a binary expression tree. You program should display the tree in some way and also print the value associated with the root. Example: (3 + ((5+9) *2)) 3 5 9 2

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

write a c++ recursive function to solve the following: str contains a single pair of parenthesis, return a new string // made of only the parenthesis and whatever those parensthesis contain. You can use substr in this problem. // // Pseudocode Example:// findParen("abc(ghj)789") => "(ghj)" // findParen("(x)7") => "(x)" // findParen("4agh(y)") => "(y)" // string findParen(string str) { }
Write a program to code text editor. Note: code in c++ The goal of this program is to implementing and using stacks and linked structures. You should also continue to use object-oriented design.For this program, you will implement a text editor. Your editor will display a string of characters and a cursor. Your program will allow the user to move the cursor and modify the text using the following five operations: left - move the cursor to the left one character or do nothing if at the end of the line right - move the cursor to the right one character or do nothing if at the end of the line rdelete n - delete n characters to the right of the cursor ldelete n - delete n characters to the left of the cursor insert c - insert the character c just before the cursor A sample run of your program should look as follows:^insert SS^insert ASA^insert MSAM^insert MSAMM^insert YSAMMY^leftSAMM^YleftSAM^MYrdelete 2SAM^insert ISAMI^rightSAMI^leftSAM^Ildelete 3^IYour program should implement a…
C PROGRAM Write a program that asks the user values for the coefficient A,B, and C in the quadratic equation Ax^2 + Bx + C= 0, and then prints the solution/s of the equation (if there is/are any) For this problem, you need to include the following header file: math.h So that you can use the C library function sqrt() The function sqrt() computes the square root of a value (in double) Use #include <stdio.h>
Code in C + In this lab we will be reinforcing our understanding of a number of concepts in C...arrays, struct, conditions, loops and loop controls - Allow the user to enter multiple pairs of x and y coordinates on a 2 dimensional graph (these numbers may be considered unitless) along with a text label for that set of points. You must use a "struct" data type to define how these are stored. - The x and y coordinates should be type "float" or "double" - Allow multiple data points to be entered by the user, so the first thing the user must ask is how many coordinates will be entered. Since multiple entries will be made you must create an array of that "struct" type. - Once all of the coordinates and labels are entered, calculate the distance between each set of points (you DO NOT have to store all of the distances!!!). In this lab you may use "math.h" (it may be useful). - Determine which coordinates are closest to each other out of all of the pairs. - Determine which coordinates are…
Using c++ Contact list: Binary Search A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe…
C++ PROGRAMMINGTopic: Binary Search Trees Explain the c++ code below.: SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONS It doesn't have to be long, as long as you explain what the important parts of the code do. (The code is already implemented and correct, only the explanation needed) #include "node.h" #include <iostream> using namespace std; class BTree { node* root; int size; node* create_node(int num, node* parent) { node* n = (node*) malloc( sizeof(node) ); n->element = num; n->parent = parent; n->right = NULL; n->left = NULL; return n; } public: BTree() { root = NULL; size = 0; } node* left(node* p) { return p->left; } node* right(node* p) { return p->right; } node* sibling(node* p){ if(p != root){ node* P = p->parent; if(P->left != NULL && P->right != NULL){…
Language/Type: C++ binary trees pointers recursion Write a function named hasPath that interacts with a tree of BinaryTreeNode structures representing an unordered binary tree. The function accepts three parameters: a pointer to the root of the tree, and two integers start and end, and returns true if a path can be found in the tree from start down to end. In other words, both start and end must be element data values that are found in the tree, and end must be below start, in one of start's subtrees; otherwise the function returns false. If start and end are the same, you are simply checking whether a single node exists in the tree with that data value. If the tree is empty, your function should return false. For example, suppose a BinaryTreeNode pointer named tree points to the root of a tree storing the following elements. The table below shows the results of several various calls to your function: 67 88 52 1 21 16 99 45 Call Result Reason hasPath(tree, 67, 99) true path exists…
Create a function in C++ using recursion where the user inputs a number. The function will repeat an equation where you get the square root of a number for the amount of loops selected. A random number between 1-10 will be used to determine the length of the loop.
C++ A matrix is a rectangular array of numbers that is arranged in a two-dimensional table. Matrices have numerous applications in computer systems. Matrix structures are examined in computer memory, graphics, and cryptography. The Hill cipher, for example, makes use of matrix inversions to encrypt and decrypt data. The intent of this problem is to develop a C++ program that computes and displays the inversion of a 2 x 2 matrix. A matrix is said to have the dimensions m x n if it has m rows and n columns. A square matrix has the same number of rows as columns, and is therefore said to have m x m dimensions. Matrix M shown below is an example of a 2 x 2 matrix. The inverse of a square matrix, M-1, is defined by the equation M(M-1) = I, where I is called the identity matrix. I is a square matrix that is all zeros except for ones along the main diagonal from the upper left corner to the lower right corner. I for a 2 x 2 matrix is: Multiplying a square matrix by its inverse will always…
Data Structure Using C++ I need a function like this ::: float postfixEval(string postfix) {int a, b;stack<float> stk;string::iterator it;for(it=postfix.begin(); it!=postfix.end(); it++) {//read elements and perform postfix evaluationif(isOperator(*it) != -1) {a = stk.top();stk.pop();b = stk.top();stk.pop();stk.push(operation(a, b, *it));}else if(isOperand(*it) > 0) {stk.push(checkNumber(*it));}}return stk.top();} to evaluate postfix with more one digit in expression (multi digits) please just this function simple like the above
Dear Sir, Please read the question carefully, and answer it with an explanation. Question: Write a C++ program of the Red-Black tree, that has the following Functions. Functions: 1. Insertion: Insert at least 8 values in a Red-Black tree. 2. Deletion: Delete 3 different nodes from the Red-Black tree you have created above. Make sure, after the deletion, the remaining tree must be a Red-Black tree. 3. Searching: Search a specific value in a Red-Black tree.