binary tree related-project

binary tree relate project see requirement below

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.

i will include all the template

A m-way node has a partially filled dynamic array. Here is the class template definition and here is the class template implementation of a m-way node.

Derive a mNode1class template from the mNodeclass template. This class overrides searchfunction of mNodeclass. The searchfunction performs binary search in the partially filled dynamic array.

Here is an *incomplete* class template definition and here is an *incomplete* class template implementation of a m-way search tree. This class uses the mNodeclass. Define removeAllmember function template *recursively*.

Define inordermember function template *recursively*. Define breadthFirstmember function template. This function processes nodes in a breadth first traversal of the tree. The function should use the queueSTL class template. Define countmember function template *recursively*. This function returns the number of items in the tree. Here is a class template definition and here is the class template implementation of an abstract m-way B tree. The bottom-up B tree and top-down B tree class templates are derived from this class template. Define the heightRmember function template *recursively* and the heightmember function template *non-recursively*. These functions return the height of the tree. (5 + 5%)

Change the member function templates that add an item. These functions create a B tree of mNode1's. This class should use a pointer to a mNode1to search a node. Use the dynamic_castoperator for this assignment statement. The virtual member function in mNodeallows the application of this operator.

The functions split a node *only* if all siblings of the node are full. If a sibling has an empty position, the function moves an item to the closest sibling. If a left sibling and a right sibling are closest, the function moves an item to the left sibling.

Change the reflowRemovemember function template. This function combines a node *only* if all siblings of the node are half full. If a sibling has an additional item, the function moves an item from the closest sibling. If a left sibling and a right sibling are closest, the function moves an item from the left sibling.

If the node has an adjacent left sibling, the function combines the node with the left sibling. If the node does not have an adjacent left sibling, the function combines the node with the adjacent right sibling. (25%)

You can only introduce a private member function template in the BTreeBUclass template. The main program instantiate a 4-way bottom-up B tree of non-negative integers. The tree should be initialized with non-negative integers in a file. The file name read from the command line.

The main program operations.

Add . Remove Remove [url removed, login to view] items using the printmember function. Print items in increasing order. Print nodes in breadth first order. Print number of items. Print height.

Quit.

## Platform

run on c++ or microsoft visual studio windows platform

Programación en C Ingeniería MySQL PHP Arquitectura de software Verificación de software

Nº del proyecto: #3008297

Sobre el proyecto