Q1) Write a template based C++ program that uses functions to perform the following:i)Write a C++ program to insert "29" in the following AVL.ii)ii) After insertion update the tree with the relevant rotations to complete the AVL treeproperties Alsodisplay the updated tree.223124

AVL Tree : It is a self-balancing binary search tree where the difference between heights of left…

Answered: Write a template based C++ program that…

Engineering

Computer Science

Write a template based C++ program that uses functions to perform the following:

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 11SA

See similar textbooks

Similar questions

Please fill in the blanks for C. /* This program will create a doubly linked list of full names. */ #include<stdio.h> #include<stdlib.h> #define LEN 100 //max length //Declare a node of string that contain a person's full name // each node has a value and 2 pointers that points to the next node and previous node struct node { __1__ value[__2__]; //to save the string (full name) __3__ __4__ next; //pointer points to next node __5__ __6__ prev; //pointer points to previous node }; /* - This function takes the head pointer and iterates through the list to get one full name at a time from the user, and save it to our list - The function uses getchar() to get 1 character at a time, and only stops when user presses Enter. - During each iteration, check if user inputs a name that is longer than max size. + Remember, if maxLen is 100, then the longest valid inputted string len is 98, because 99th index is for null character. + So we…
Given the definitions of a Node struct and head pointer, write C++ statements to perform the following tasks: a.output the count of all the numbers in the list that are greater than 20 b.output the value of the node preceding the node containing the value 100.c.assuming p is already pointing to a node, insert a node containing 25 after that node.
Tree Traversal Coding: How do I code the following in C program? // ====== BEGIN INSERT FUNCTION DEFS TO WALK TREE ========= // define 3 functions - preorder, inorder, postorder to walk tree, printing out data (char) // associated with each node visited: void preorder (node* np) {} void inorder (node* np) {} void postorder (node* np) {} walk.c file with the rest of the code given. #include <stdio.h> #include <stdlib.h> #include <stdbool.h> #include <string.h> #define MAX_STRING 200 // ========================== NODE/TREE DEFINITIONS ========================== // define node structure typedef struct nd { int data; struct nd* left; struct nd* right; } node; // "new" function to create a node, set data value to d and children to NULL node* newNode(int d) { node* np; np = (node*)malloc(sizeof(node)); if (np != NULL) { np->data = d; np->left = NULL; np->right = NULL; } return(np); } // declare root of our binary tree…
PLEASE DO NOT USE BUILT IN FILES OR FUNCTIONS! Write a program in c++ and make sure it works, that reads a list of students (first names only) from a file. It is possible for the names tobe in unsorted order in the file but they have to be placed in sorted order within the linked list.The program should use a doubly linked list.Each node in the doubly linked list should have the student’s name, a pointer to the next student, and apointer to the previous student. Here is a sample visual. The head points to the beginning of the list. Thetail points to the end of the list.When inserting consider all the following conditions:if(!head){ //no other nodes}else if (strcmp(data, head->name)<0){ //smaller than head}else if (strcmp(data, tail->name)>0){ //larger than tail}else{ //somewhere in the middle} When deleting a student consider all the following conditions:student may be at the head, the tail or in the middleBelow, you will find a sample of what the…
Python help Choose the right data structure (Stack, Queue, Deque) and create a function that takes two file (first_file, updated_file) where first_file has alot of duplicated string sentecens, (create a function that sorted the string from first_file using the total sentence length and if in cases where two lines of sentences have the same length, solve it using sorted order. also duplicated line should only be stored once. Once you sort the sentence, write all the stored sentence to updated_file
I'm looking over my code for my tree and I keep receiving segmentation faults when I try to add or search for value in the tree. Is there something that I am missing in my addNode or newNode function? #include <stdio.h>#include <stdlib.h> // Austin Chong// The core concept of this assignment is to use and create a BST in a C Program.// 7 April 2020 struct node{int data;struct node *left;struct node *right;}; struct node *newNode(int data){struct node *temp = (struct node*)malloc(sizeof(struct node));temp -> data = data;temp -> left = NULL;temp -> right = NULL;return temp;} struct node *addNode(struct node* node, int data){if(node == NULL){return newNode(data);} if(data < node -> data){node -> left = addNode(node -> left, data);} else {node -> right = addNode(node -> right, data);}return node;} void findData(struct node *node, int value){if(node -> left == NULL && node -> right == NULL && node -> data != value)…
Answer the following in data structure A. Write a program to insert data into a Binary Search Tree (BST). B. Write functions for two primary operations in the stack Push ( ) and Pop ( ). C. Write a function to search data in a binary tree. D. Write a function to find minimum value in a binary search tree.
Problem Statement: Write a program which should create a binary search tree of the values entered by the user and then write functions that perform following functionalities. Traversal: 1. Inorder 2. Preorder 3. Postorder 4. Level order (Breadth first search) Functions that find the following: For every algorithm, root node is given as input along with any other input (if mentioned). 1. To find and return parent of given node? 2. To find and return depth/level of given node? 3. To find and return height of tree? 4. To find if two nodes are at same level of tree or not? 5. To find and return total number of nodes? Your assignment should contain followings.  Title page  Problem statement  Code  Screen shots for each option/functionality
Stacks 1- Write a Python function that takes a user input of a word and returns True if it is a Palindrome and returns False otherwise (Your function should use a Stack data structure). A palindrome is a word that can be read the same backward as forward. Some examples of palindromic words are noon, civic, radar, level, rotor, kayak, reviver, racecar, redder, madam, and refer. 2- Write a Python function that takes a stack of integer numbers and returns the maximum value of the numbers in the stack. The stack should have the same numbers before and after calling the function. 3- Write a main function that tests the functions you wrote in 1 and 2 above and make sure that your code is well documented.
Please do this in C++. The only parts needed are commented as //TODO in MAIN. Please do not use cout, the PrintNodeData in MileageTrackerNode.cpp needs to be called. I am struggling with adding data into the linked list. Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user-input value is the number of nodes in the linked list. Use the PrintNodeData() function to print the entire linked list. DO NOT print the dummy head node. Ex. If the input is: 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 the output is: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 Main.cpp #include "MileageTrackerNode.h"#include <string>#include <iostream>using namespace std; int main (int argc, char* argv[]) {// References for MileageTrackerNode objectsMileageTrackerNode* headNode;MileageTrackerNode* currNode;MileageTrackerNode* lastNode; double miles;string date;int i; // Front of nodes listheadNode = new…
1.) Design a Binary Search Tree ADT by using following functions. Include the function definitions & run the program (Kindly include header files as well). Paste the output as a screenshot and write the code in your answer sheet. insert(int val)find(int x)************************************************************************************ class btNode { public: int info; btNode *lLink; btNode *rLink; btNode(int e, btNode *l = NULL, btNode *r = NULL) { info = e; lLink = l; rLink = r; } btNode() { lLink = NULL; rLink = NULL; } }; class binarySTADT { private: btNode *root; int count = 0; public: binarySTADT() { root = NULL; } void insert(int val); // function to insert a given value in the tree.…
Program - Python (Problem is below code) def main():student_dictionary=\{'Brian': [94, 89, 92],'Rachel': [100,90,65],'Jon': [67.5,95,100],'Brit': [0,78,80] ,'Gret': [65,100,78],'Andrea': [55.5,67,79]}for key, values in student_dictionary.items():print('Name: ', key, " , Marks:", values)if __name__ == '__main__':main() Problem: Make a new dictionary. Using the dictionary I made from above,. the new dictionary should consist of the key is the name of the person, and the value is just the average of their scores. So it’s six key value pairs but instead of the value being a list like the first problems, this time it's just their average (which you compute from their scores in the other dictionary. Print the new dictionary out.