Question

Create a binary tree class.

-Data array field (private)

-Count field

Add method(data)

-The add method takes a data point, add it to the count position in the array then increases the count.

Print method(void)

-Prints all the fields in the tree.

C++, no libraries are allowed (only )

Answer 1

The Binary tree in an array is stored as:-

if the node is at nth postion, then the left child will be at 2*n + 1 postion and the right child will be at 2*n + 2 position,

So if we enter data one by one into the array it will first go to root node then to its left child and then to its right child, and this process will repeat with left chid being the root node, and then right child and so on.

The code for above program is given below, I have commented inline for the explanation :-

#include <iostream>

using namespace std;

class Binary_tree
{
private:
long data; // private variable data
public:
int count=0;// public variable count
  
// method to add the data, it returns the added value
// so we can add it to the array
long add(long data)
{
this->data = data;// adds the data
this->count++;// after adding increaments the counter
return this->data; // returns the added value
}
};

// method to print the binary tree
void print(long arr[], int n)
{
cout<<"The Binary tree is:- \n";
  
for(int i=0;i<n;i++)
{
cout<<"At position "<<i<<" the data is: "<<arr[i]<<"\n";
}
}
  

int main()
{
int n;
cout<<"Enter number of data you want to enter: ";
cin>>n;
long arr[n];// array to store the binary tree
  
Binary_tree bt;// Binary_tree calss object
cout<<"enter the values:- \n";
for(int i=0;i<n;i++)
{
int val;
cin>>val;// takes the value
arr[bt.count]=bt.add(val);// adds in the array and increaments the counter
}
  
// print the Binary_tree array
print(arr,n);

return 0;
}

Output:-

Hope it clears your doubt