C++ please Please complete Programming Exercise 4, from pages 1402, from chapter 19 from your textbook. Write a function, singleParent, that returns the number of nodes in a binary tree that have only one child. Add this function to the class binaryTreeType and create a program to test this function. (Note: First create a binary search tree.)

C++ please Please complete Programming Exercise 4, from pages 1402, from chapter 19 from your textbook. Write a function, singleParent, that returns the number of nodes in a binary tree that have only one child. Add this function to the class binaryTreeType and create a program to test this function. (Note: First create a binary search tree.)

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 18PE

See similar textbooks

Similar questions

Please complete Programming Exercise 4, from pages 1402, from chapter 19 from your textbook. Write a function, singleParent, that returns the number of nodes in abinary tree that have only one child. Add this function to the classbinaryTreeType and create a program to test this function. (Note: Firstcreate a binary search tree.)
Write the definition of the function nodeCount that returns the number of nodes in the binary tree and Add this function to the class binaryTreeType and create a program to test this function. USE THIS FILE FOR YOUR PROGRAM USE THIS FILE TO TEST YOUR PROGRAM #include <iostream> //Line 1#include "binarySearchTree.h" //Line 2using namespace std; //Line 3void print(int& x); //Line 4void update(int& x); //Line 5int main() //Line 6{ //Line 7bSearchTreeType<int> treeRoot; //Line 8int num; //Line 9 cout << "Line 10: Enter numbers ending "<< "with -999." << endl; //Line 10cin >> num; //Line 11while (num != -999) //Line 12{ //Line 13treeRoot.insert(num); //Line 14cin >> num; //Line 15} //Line 16cout << endl << "Line 17: Tree nodes in inorder: "; //Line 17treeRoot.inorderTraversal(print); //Line 18cout << endl << "Line 19: Tree Height: "<< treeRoot.treeHeight()<< endl << endl; //Line 19cout <<…
PLEASE WRITE IN C++ Implement a program that uses an array based binary tree (sequential tree) that has a menu with these options: 1.) insert (This option asks the user for a size and then creates the array based tree, filling the tree with characters or integers . Fill the sequential tree as a complete tree and insert keys as children to specific parents, It is also straightforward to insert children to specific parents due to the fixed nature of the parent child relationship, with a parent having children at indexes ( 2 * Parent index ) + 1, and + 2.). 2.) search (asks user for a character to search in the tree then prints if it is in the tree or not.) 3.) quit (exits program)
Can help in Java? Qustion : Using Binary search tree write a Java program to Insert and print the element in (in-Order traversal ), then search the elements (a and z) in the tree… provided that user enters the values.
Write a function that inserts the nodes of a binary tree into an ordered linked list. Also write a program to test your function.
USE PYTHON Write a function to traverse the binary search tree using inorder traversal in python. Dont use python libraries or OOP concepts
Write a code to delete a node from a Binary search tree. The format of the function is void deleteNode(int key). Note - Do not use any other return form for the function. Do not return any node pointers
Please answer in c++ Please implement BST sort and test it for correctness. The program will prompt for the name of an input file and the read and process the data contained in this file. The file contains a sequence of integer values. Read them and construct a binary search tree from the values in the order they are read. Thus; the first number read will be the root of the tree. For this exercise, you may use dynamic data, but it is better to store the numbers sequentially in an array. You do not need to balance the tree as you construct it. When you have read the last value into the BST, conduct an in‐order traversal to output the values in ascending order. Print them 10 to a line in a 5‐character wide field. Note: there may be duplicated value in the input file – in this case each copy of the number should be kept in the tree and output. E.g. if the input was 3 5 3, the output would be 3 3 5. As usual, do not use classes or STL. text file:…
please I need a c++ implementation for this recursive function! Thank you in advance #ifndef H_binarySearchTree #define H_binarySearchTree #include <iostream> #include <cassert> #include "binaryTree.h" //************************************************************* // Author: D.S. Malik // // This class specifies the basic operations to implement a // binary search tree. // Revised by Dr. Ji on Npv 30 2021 //************************************************************* using namespace std; template<class elemType> class bSearchTreeType: public binaryTreeType<elemType> { public: bool search(const elemType& searchItem) const; //Function to determine if searchItem is in the binary //search tree. //Postcondition: Returns true if searchItem is found in the // binary search tree; otherwise, returns false. void insert(const elemType& insertItem); //Function to insert insertItem in the binary search tree. //Postcondition: If no node in the binary search tree has…
8-Write a procedure that takes a tree (represented as a list) and returns a list whose elements are all the leaves of the tree arranged in right to left order or left to right. For example, ( leaves '((1 2) ((3 4) 5 )) returns (1 2 3 4 5) or (5 4 3 2 1). Then, Manually trace your procedure with the provided example.
-- > In C++ write a program without using classes, and build in functions, only use structure.!!!!!! Populate a tree via a text file (input.txt) Make sure that after every insert, the tree is balanced.At the end, display the tree in level format. Make sure to include the height and the balancefactor of every node in your output. Redirect the display to an output file (output.txt)Hint://I will not accept any other algorithm//This is not a recursive algorithmnode * rebalance(node *node){node->height = max(height(node->left), height(node->right)) + 1;int balance = getBalance(node); //node->left - node->right/*do rotations as necessaryIf Left heavy outside : return rightRotate(node);If right heavy outside: return leftRotate(node);If left heavy inside: left rotation first, right rotation 2nd, return top nodenode->left = leftRotate(node->left);return rightRotate(node);if right heavy inside: right rotation first, left rotation 2nd, return top nodenode->right =…
Part II: Implement text compression. In this part, use a text file as input, read through the text file, calculate the frequencies of each character, apply your Huffman Algorithm to encode the text file into a new file. You program should have the following functions, besides the above functions. Encode: takes a text file name, calls the Huffman coding algorithm, traverse the tree to get the code word, and then encode the text file into a new file. Decode: takes a prefix tree, and an encoded file, decode the file. What to turn in: Well documented source code in C++. Run your algorithm for 20 files and show the compression ratio of the size of the original file and the size of the compressed file. Show the ratios in the table. //code // C++ program for Huffman Coding #include <iostream> #include<queue> #include<vector> #include<string> #include<map> using namespace std; /*structure to represent node of huffman tree*/ struct node { // One of the…