Write a program in C++ for binary tree that implement following methods: Create(P, X) : P is location of parent of node which is to be created, X is either Left or Right. Delete(N): N is location of node which is to be deleted. If the node to be deleted is an internal node, fill the space vacated by deleted node by moving the last node (rightmost node at the last level) to the vacant space. Display() : display the entire binary tree (information and location of each node, location of its left and right children) Search(v): v is some value, search all node(s) n having value equal to v and print the location of those node(s). Also print the location of parent of those node(s). Also, implement the inorder, preorder and postorder traversal of binary tree. Your program should implement two classes. One class should use sequential representation. Second class should use linked representation using arrays.

Write a program in C++ for binary tree that implement following methods: Create(P, X) : P is location of parent of node which is to be created, X is either Left or Right. Delete(N): N is location of node which is to be deleted. If the node to be deleted is an internal node, fill the space vacated by deleted node by moving the last node (rightmost node at the last level) to the vacant space. Display() : display the entire binary tree (information and location of each node, location of its left and right children) Search(v): v is some value, search all node(s) n having value equal to v and print the location of those node(s). Also print the location of parent of those node(s). Also, implement the inorder, preorder and postorder traversal of binary tree. Your program should implement two classes. One class should use sequential representation. Second class should use linked representation using arrays.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 21SA

See similar textbooks

Similar questions

Write a program using c++ to implement a character-based Binary Search Tree (BST). Each node in the BST should be store student name (string) as follows: class Node{// node prototype public:       char ch;// this letter is taken from student first letter       string studentName;       Node *leftChild;       Node *rightChild; }; For example, if a student’s name is Adam then ch will be equals to A. If the student’s name is Lee then ch will be equal to L.       The insertion of a node to the BST is based on the first letter of the student name. Your program should display the following: 1.     Insert a node (base on ch) 2.     Find a node (base on student name) 3.     Delete a node (consider all three cases of delete) 4.     Exit and Output/results provided and explain the algorithm with a given input.
Write a program using c++ to implement a character-based Binary Search Tree (BST). Each node in the BST should be store student name (string) as follows: class Node{// node prototype public:       char ch;// this letter is taken from student first letter       string studentName;       Node *leftChild;       Node *rightChild; }; For example, if a student’s name is Adam then ch will be equals to A. If the student’s name is Lee then ch will be equal to L.       The insertion of a node to the BST is based on the first letter of the student name. Your program should display the following: 1.     Insert a node (base on ch) 2.     Find a node (base on student name) 3.     Delete a node (consider all three cases of delete) 4.     Exit Step by step output: ------------------------------------------------------------------------------------------------------------ Insert a node (base on ch) Find a node (base on student name) Delete a node (consider all three cases of…
Extend program BinarySearchTree.java by adding the following operations to the BinarySearchTree class: a.         Find the height of the BST. b.         Find node with the largest key. c.         Find the average of the key values of the nodes. d.         Print the nodes in the tree in pre-order, in-order, and post-order. (decided by the user after run) e.         Create the same BST shown in question 2. Run your program for the BST shown in question 1 to             its final state and output the height, the largest key, and average of the keys. import java.util.*; public class BinarySearchTree1{ public Node root; public BinarySearchTree1() { root = null; } public Node getroot() { return root; } public Node Search(int KEY) { Node x = root; while (x != null && x.item != KEY) { if (KEY < x.item) { x = x.Left; } else { x =…
Extend program BinarySearchTree.java by adding the following operations to the BinarySearchTree class: Show the results. a. Find the height of the BST. b. Find node with the largest key. c. Find the average of the key values of the nodes. d. Print the nodes in the tree in pre-order, in-order, and post-order. (decided by the user after run) e. Create the same BST shown in question 2. Run your program for the BST shown in question 1 to its final state and output the height, the largest key, and average of the keys. import java.util.*; public class BinarySearchTree1{ public Node root; public BinarySearchTree1() { root = null; } public Node getroot() { return root; } public Node Search(int KEY) { Node x = root; while (x != null && x.item != KEY) { if (KEY < x.item) { x = x.Left; } else {…
Write a C++ program to implement binary search tree (BST). Your program should accept a list ofnumbers from the user (minimum 5) and then build a binary search tree from those numbers.Implement following functions: Serach function: Number is found or not leavesCount: Returns number of leaves in binary tree inorder: Print the contents of tree using inorder traversal Note: Define three files: bst.h, bst.cpp, main.cpp to solve this problem
Write a function, singleParentWithLeftChild, that returns the number of nodes in a binary tree (pointed by p) that have only one left child. Your program should NOT count the nodes with one right child. (30 point) // find the number of singles parent nodes in a binary subtree pointed by p int BST::singleParentWithLeftChild(TreeNode* p) { // write your code here! }
In C++, develop an algorithm that inserts the value val into a binary search tree with root. If the tree is empty, root = null. The algorithm returns the root of the tree containing the added item. You should assume that “new node” creates a new node with data field data and reference fields left (for left child) and right (for right child).
Given a binary tree with integer data at all nodes (including leaves), your task is to create a pretty printer. Each node in the tree can have 0, 1, or 2 children in python3. constructor that takes a required int argument for the data stored in the node, and two optional Node arguments for the left and right children, respectively. __str__(self) -> str: returns a string representation of the subtree rooted at the self node [must use recursion] compute_height(self) -> int: returns the height of the current node. The height is the distance of the longest path between a leaf node and the current node. [must use recursion] pretty_print(self, indent: int): prints a formatted tree string with each node on a separate line, using the format value: height, and making sure that sibling and cousin nodes (i.e., those at the same distance from the root node) are indented using the same number of spaces (see example below). The root is indented 0 spaces, the children of the root are indented…
Write Java code to: find the lowest common ancestor of two nodes n1, n2 in a linked binary tree structure. The lowest common ancestor is the lowest node in the tree thathas both n1 and n2 as descendants.
Rewrite the definition of the function searchNode of the class B-tree provided (bTree.h) by using a binary search. Write a C++ code to ask the user to enter a list of positive integers ending with -999, build a b- tree of order 5 using the positive integers, and display the tree contents. Also, ask the user to enter a number to search and display if the number is found in the tree. bTree.h
I am to write a function that receives the root of a binary tree t and a number k and determine if the node where k is stored is the left child of its parent. if k is not in the tree, or does not have a parent, or is a right child the function should return false. Starting code: def is_left_child(t,k): parent, x = t.find(k, return_parent = True) return False
Write a program of binary tree using linked list. Elements of this linked list should be of integer type, user will provide values as input for elements of binary tree. Your program should allow insert new node, searching node of a value specified by user in binary tree and if the node on leaf than allow delete the node specified by user.