kopiec

#include <iostream>
#include <string>
#include <ctime>
#include <cstdlib>

using namespace std;



string cr,cl,cp;
int T[15], n = 0;

void printBT(string sp, string sn, int v)
{
  string s;

  if(v < n)
  {
    s = sp;
    if(sn == cr) s[s.length() - 2] = ' ';
    printBT(s + cp, cr, 2 * v + 2);

    s = s.substr(0,sp.length()-2);

    cout << s << sn << T[v] << endl;

    s = sp;
    if(sn == cl) s[s.length() - 2] = ' ';
    printBT(s + cp, cl, 2 * v + 1);
  }
}

void heap_push(int v)
{
  int i,j;

  i = n++;
  j = (i - 1) / 2;

  while(i > 0 && T[j] < v)
  {
    T[i] = T[j];
    i = j;
    j = (i - 1) / 2;
  }

  T[i] = v;
}

int main()
{
  int i, v;

  srand(time(NULL));



  cr = cl = cp = "  ";
  cr[0] = 218; cr[1] = 196;
  cl[0] = 192; cl[1] = 196;
  cp[0] = 179;
 int menu;
    bool wyjscie=false;
    do
    {


    cout<< "Co chcesz zrobic?"<<endl;
    cout<< "1. Dodac elementy do drzewa"<<endl<<endl;
    cout<< "2. Przeglad drzewa"<<endl<<endl;
    cout<< "3. Wyszukanie elementu w drzewie"<<endl<<endl;
    cout<< "4. exit"<<endl<<endl;
    cin>>menu;
    switch(menu)
    {
        case 1:
    for(i = 0; i < 15; i++)
    {
      cin>>v;
    heap_push(v);
     }
     break;
        case 2:
           printBT("","",0);
            break;
        case 3:

            break;

        case 4:
            wyjscie=true;
            break;
    }
    }while(wyjscie==false);




}