Question

Extend the array based Binary Tree lab by adding these methods.

(Remember 2i + 1 & 2i + 2)

Preorder(int)

-Recursive method that prints all the nodes in a VLR pattern.

Inorder(int)

-Recursive method that prints all the nodes in a LVR pattern.

Postorder(int)

-Recursive method that prints all the nodes in a LRV pattern.

C++, no libraries are allowed

Answer 1

#include
using namespace std;

void inorder(int a[], int root, int n )
{
if(root<n)
{
inorder(a,2*root+1, n);
cout<<a[root]<<" ";
inorder(a,2*root+2, n);
}
return ;
}
void preorder(int a[], int root, int n )
{
if(root<n)
{
  
cout<<a[root]<<" ";
preorder(a,2*root+1, n);
preorder(a,2*root+2, n);
}
return ;
}
void postorder(int a[], int root, int n )
{
if(root<n)
{
postorder(a,2*root+1, n);
postorder(a,2*root+2, n);
cout<<a[root]<<" ";
}
return ;
}
int main() {
int a[7]={1,2,3,4,5,6,7};
int n = 7;
inorder(a,0,n);cout<<endl;
preorder(a,0,n);cout<<endl;
postorder(a,0,n);cout<<endl;
  
   return 0;
}