write a function to initialize an array with n random values write a function to build this binary tree with the above definition with anydata structure write a function to display the tree information write a function to search an input value using recursion. If found, display all the subtree with the found node as the root of this subtree’ or else return -1. write a function to insert new nodes into the tree and another one to remove nodes from the tree
A binary tree can be used to sort n elements of an array data. First, create a
complete binary tree, a tree with all leaves at one level, whose height h = (lg n) + 1, and store all elements of the array in the first n leaves. In each empty leaf, store an element E greater than any element in the array.
Figure (a) shows an example for data = 8, 20, 41, 7, 2, h = (lg(5)) + 1 = 4,
and E = 42. Then, starting from the bottom of the tree, assign to each node the minimum of its two children values, as in Figure (b), so that the smallest element emin in the tree is assigned to the root.
If a leaf node is to be removed, this node is replaced by a new node with the same value of its parent node.
If a node is added into the tree, it will be a leaf node. Normally a node with value E is replaced with new value. It’s necessary to verify recursively all values of its parent and make any possible modification if necessary so that the tree rules are respected.
Implement this tree structure in C/C++ with the necessary functions.
- write a function to initialize an array with n random values
- write a function to build this binary tree with the above definition with anydata structure
- write a function to display the tree information
- write a function to search an input value using recursion. If found, display all the subtree with the found node as the root of this subtree’ or else return -1.
- write a function to insert new nodes into the tree and another one to remove nodes from the tree
Step by step
Solved in 4 steps with 24 images
