Use C++ language to do this exercise, BST (BinarySearchTrees) template in attach files.
Write a program that manage your phonebook contact using BST
It helps to find easily and rapidly the phone number of your friend based on the name and inverse . Contact can be saved in text file. User can read contact already saved in t

A. Write 3n − (k + 5) in prefix notation: ????.
b. If T is a binarytreewith 100 vertices, its minimum height is ????.
c. Every full binarytreewith 50 leaves has ???? vertices.

# Recall that a binarytree can be defined recursively as:
* A BinaryTree is either empty
* or A BinaryTree consists of a node with a left and right child both of which are BinaryTrees.
The degree of a node in a tree is equal to 0 if both children are empty, 1 if one of the children are empty, and 2 of both children ar

10.30.
Use the integers from one to nine to build a nine-node binarysearchtreewith no duplicate data values
(a). Give the possible root node values if the depth of thetree is 4.
(b). Answer part (a) for depths of 5, 6, 7, and 8.

Among other things, a binarysearchtree can be used for sorting data elements. This project is to randomly generate a sequence of integer numbers, insert the first 20 distinct numbers into a binarysearchtree, and finally produce an in-order listing of thetree. You are provided withthe declarations and two functions for bina

Trees can be used for many applications in computer science. One of these applications is decision-making, which is often used in the creation and analysis of databases.
a) In one paragraph, define what trees are. Be sure to mention the difference between binary and n-ary trees.
b) Represent the following hierarchical data

1. Use the breadth first search algorithm to find a spanning tree for the following connected graph. Start with A and use alphabetical order when there is a choice for a vertex.
2. For the following rooted tree, identify the following:
(a) Which node is the root?
(b) Which nodes are the internal vertices?
(c) Is th

My goal, given two binarytrees, is to return true if they are structurally identical, meaning they are made of nodes withthe same values arranged in the same way.
Each line of values in input file "tree2Data.txt" represents one linear binarytree, where ' _ ' represents a no value node.
Compare all trees to all other tre

Use the attached BinarySearchTree template (BST.h) for the following exercises.
1. Write a recursive member function level() for class template BST(BinarySearchTree) that determines the level in the BST at which a specified item is located. The root of the BST is at level 0, its children are at level 1, and so on.
2. W