Drzewo binarne PDF

Preview

Summary

Proste drzewo binarne...

Description

Proste drzewo binarne: #include #include //#include #include #include #include #include

using namespace std; int wybor; int *root; void clear() { #ifdef WIN32 system("cls"); #else system("clear"); #endif } //-------------------------------- Drzewo binarne zwykłe--------------------------------// void add(int dane[], bool space[] ,int n, int x) { if (space[1]==true) { root=&dane[1]; *root=x; space[1]=false; } else { bool found=false; int node=1; while (found==false) { if (space[node]==true) { found=true; dane[node]=x;

space[node]=false; } else if(xn) { cout...