Program in C++ Create an abstract class Binary_Tree having three traversal functions (preorder, inorder, postorder) and another function to calculate the height of the binary tree. Derive a class BST (Binary search tree) from Binary_tree having a suitable insert and delete functions. Derive another class AVL Tree from BST which must be balanced.

Program in C++ Create an abstract class Binary_Tree having three traversal functions (preorder, inorder, postorder) and another function to calculate the height of the binary tree. Derive a class BST (Binary search tree) from Binary_tree having a suitable insert and delete functions. Derive another class AVL Tree from BST which must be balanced.

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

See similar textbooks

Similar questions

Write a class for implementing a simple binary search tree capable of storing numbers. The class should have member functions void insert(double x) bool search(double x)void inorder(vector <double> & v )The insert function should not use recursion directly, or indirectly by calling a recursive function. The search function should work by calling a private recursive member function bool search(double x, BtreeNode *t) The inorder function is passed an initially empty vector v: it ﬁlls v with the inorder list of numbers stored in the binary search tree. Demonstrate the operation of the class using a suitable driver program.
Write a program in C++ of binary tree using linked list for objects of “person” class. Attributes of “person” class (privately defined) are per_id (int), per_name (string) and per_age (int). “person” class contains member functions (publicly defined): constructor, input and output functions. You are required to define two more classes: one of these classes should define the node implementation of linked list for objects of “person” class. Other class should define the binary tree implementation for objects of “person” class, this class should contain the member functions like insert, search, delete, pre order, and post order and in order traversals of binary tree.
Using c# , Write a constructor for the binary search tree class that accepts a sorted list L and builds aperfectly balanced binary search tree. Because constructors cannot be recursive, anothermethod called Build must be defined to carry out the actual construction of the tree.
Java - Write an insert module for a Binary Tree data structure. The module will take two parameters: a root pointer/reference to a TreeNode, and a character as a data element (each TreeNode has a character data element called "data", and 2 references to a TreeNode; called "left" and "right"). This insert module is not a member method. Higher values go to the left. Do NOT assume the existence of any other methods
In C++ Please Write a struct Student that has member variables: (string) first name, (int) age and (double) fee. Implement the Splay tree whose each node has data component an instance of the struct Student. Comparison of the nodes must be made with respect to age. Write the following functions along with necessary functions to: (i) search elements in the tree; (ii) insert nodes in the tree; (iii) print the tree in pre-order traversal fashion; (iv) delete a node from the tree; Implement the following (you can hardcode the inputs): (i) insert seven elements in the tree: (Kabeer, 19, 35.17), (John, 21, 31.65), (Paul, 25, 33.43), (Kaur, 18, 34.93), (Patel, 23, 36.37), (Alexander, 22, 33.78), (Ramesh, 27, 34.46); (ii) print the tree in pre-order fashion; (iii) delete an element from the tree (John, 21, 31.65); (iv) search an element (Alexander, 22, 33.78) in the tree; (v) print the tree in pre-order traversal fashion;
I NEED HELP WITH THE FUNCTION THAT PRINTS THE LINKED LIST AND THE ASSINGNMENT OPERATOR FUNTION ONLY Here is a C++ class definition for an abstract data type WordTree of string objects. You must store the words and the counts of the words in a single binary search tree. Each word occurring in the text can only be stored once in the tree. Implement each member function in the class below. The WordTree class may have only one member variable, root, and it must be private. You may add additional private members functions to the WordTree class. Some of the functions we may have already done in lecture, that's fine, try to do those first without looking at your notes. Remember to provide an appropriate copy constructor, destructor and assignment operator for the WordTree class as well. #include <iostream> #include <string> typedef std::string WordType; struct WordNode { WordType m_data; WordNode *m_left; WordNode *m_right; // You may add additional data members and member…
Use the STL stack template class to develop a custom queue class (named cnPtrQueue). ○ The cnPtrQueue has member variable numItems (that keeps track of the number of items in the queue), which should be helpful for implementing the member function size() (for inspecting the number of items in the queue). ● Use the cnPtrQueue to perform a breadth-first (level) traversal of a linked list of linked lists data structure and process (print) the data items stored in the structure. Fill in the "holes" intentionally left: Implementation of cnPtrQueue in cnPtrQueue.cpp.
Use the STL stack template class to develop a custom queue class (named cnPtrQueue). ○ The cnPtrQueue has member variable numItems (that keeps track of the number of items in the queue), which should be helpful for implementing the member function size() (for inspecting the number of items in the queue). ● Use the cnPtrQueue to perform a breadth-first (level) traversal of a linked list of linked lists data structure and process (print) the data items stored in the structure. Fill in the "holes" intentionally left: ► Function body of ShowAll_BF in nodes_LLoLL.cpp. ○ You are to put the cnPtrQueue (NOT the STL queue) to use here. nodes_LLoLL.h void ShowAll_BF(PNode* pListHead, ostream& outs) { // to be implemented (part of assignment) // (put at near top to facilitate printing and grading) }
Use the STL stack template class to develop a custom queue class (named cnPtrQueue). ○ The cnPtrQueue has member variable numItems (that keeps track of the number of items in the queue), which should be helpful for implementing the member function size() (for inspecting the number of items in the queue). ● Use the cnPtrQueue to perform a breadth-first (level) traversal of a linked list of linked lists data structure and process (print) the data items stored in the structure. Fill in the "holes" intentionally left: ► Function body of ShowAll_BF in nodes_LLoLL.cpp. ○ You are to put the cnPtrQueue (NOT the STL queue) to use here.
Develop an array implementation of a binary search tree builtupon an array implementation of a binary tree by using thesimulated link strategy. Each element of the array will need tomaintain both a reference to the data element stored there and thearray positions of the left child and the right child. You also needto maintain a list of available array positions where elements havebeen removed, in order to reuse those positions.
please give a correct c++ code Write a struct Student that has member variables: (string) first name, (int) age and (double) fee. Implement the Splay tree whose each node has data component an instance of the struct Student. Comparison of the nodes must be made with respect to age. Write the following functions along with necessary functions to: (i) search elements in the tree; (ii) insert nodes in the tree; (iii) print the tree in pre-order traversal fashion; (iv) delete a node from the tree; Implement the following (you can hardcode the inputs): (i) insert seven elements in the tree: (Kabeer, 19, 35.17), (John, 21, 31.65), (Paul, 25, 33.43), (Kaur, 18, 34.93), (Patel, 23, 36.37), (Alexander, 22, 33.78), (Ramesh, 27, 34.46); (ii) print the tree in pre-order fashion; (iii) delete an element from the tree (John, 21, 31.65); (iv) search an element (Alexander, 22, 33.78) in the tree; (v) print the tree in pre-order traversal fashion;
Java coding ADT Binary Search tree:A binary search tree can be used to store a list of comparable objects. In a generic binary search tree class, constrain E(the type parameter) to be the class types that implement Comparable interface. In the class header, add the interface as the upper bound to E.public class BinarySearchTree<E extends Comparable<E>>Specifications of the ADT binary search tree:• Construct a binary search tree.• Retrieve the root of this tree.• Change the root of this tree if supported.• Check if this tree is empty.• Make this tree empty.• Search an element in this tree.• Insert an element into this tree.• Delete an element from this tree.• Construct an iterator of this tree.• Get a reference to the element of a node.You should design these operations in bold in a super class and put the rest in a sub class. To support this class, the following classes must be designed and implemented:• Generic tree node class: a tree node contains an element, a left…