[AiSD] 6. Drzewo

#include <iostream>
using namespace std;

//=================
//TABLICOWO
//=================

const int N = 12;
int drzewo[N] = {12,7,19,3,9,15,-1,-1,-1,-1,-1,14};

void preorder(int p){
    if(p<N && drzewo[p]!=-1)
    {
        cout<<drzewo[p]<<" ";
        preorder(2*p+1);
        preorder(2*p+2);
    }
}

void inorder(int p){
    if(p<N && drzewo[p]!=-1)
    {
        inorder(2*p+1);
        cout<<drzewo[p]<<" ";
        inorder(2*p+2);
    }
}

void postorder(int p){
    if(p<N && drzewo[p]!=-1)
    {
        postorder(2*p+1);
        postorder(2*p+2);
        cout<<drzewo[p]<<" ";
    }
}


int main(){
    cout<<"[PREORDER]: ";
    preorder(0);
    cout<<endl;
    cout<<"[INORDER]: ";
    inorder(0);
    cout<<endl;
    cout<<"[POSTORDER]: ";
    postorder(0);
    return 0;
}