бинарные деревья - C++ - Ответ 2124236

#include <iostream>
#include <cstdlib>
#include <conio.h>
#include <stdlib.h>
 
using std::cout;
using std::endl;
using std::cin;
int count = 0;
 
struct TREE {
    int info;
    TREE *pLeft;
    TREE *pRight;
};
 
 
 
void createTree ( TREE **current, int n)
{
    if (!n) *current = NULL;
    else
    {
        int x;
        int nl = n/2;
        int nr = n - nl - 1;
        TREE *tmp = new TREE;
        cout << "\nEnter key values:";
        cin >> x;
        tmp->info = x;
        count++;
        createTree( &tmp->pLeft, nl );
        createTree( &tmp->pRight, nr );
        *current = tmp;
    }
}
 
void ShowSymmetrical ( TREE *current, int h )
{
    if (current)
    {
        ShowSymmetrical(current->pRight, h+1);
        for ( int i =0; i <h;i++)
            cout << "\t";
        cout << current->info << endl;
        ShowSymmetrical(current->pLeft, h+1);
    }
}
 
void clearTree (TREE **current )
{
    if (*current != NULL)
    {
        clearTree(&(*current)->pLeft);
        clearTree(&(*current)->pRight);
        delete *current;
        count--;
        if ( count == 0 )
            *current = 0;
    }
}
 
void CheckTree (TREE *current, int h )
{
    if ( !current )
    {
        cout << "Nothing";
    }
}
 
 
TREE* findMax ( TREE *current, TREE **max )
{
    if ( current )
    {
 
        if ( *max->info < current->info )  {cout << "step: " << *max->info; *max = current;  }
 
        findMax ( current->pLeft, &max);
        findMax ( current->pRight, &max);
        //cout << max->info;
        return max;
    }
}
 
 
int main ( int argc, char** argv )
{
    TREE *root = NULL;
    TREE *pMaxL;
    TREE *pMaxR;
 
    clearTree(&root);
    cout << "Enter number of keys: ";
    int n;
    cin >> n;
    createTree(&root, n);
 
    cout <<endl << endl;
    ShowSymmetrical(root, 1);
    cout <<endl << endl;
 
 
    pMaxL = root->pLeft;
    pMaxL = findMax (root->pLeft, &pMaxL);
    //cout << pMaxL->info;
 
    system("pause");
    return 0;
}