SatieTrees

#include <iostream>

using namespace std;

struct TreeNode {
    int data;
    TreeNode *left;
    TreeNode *right;
};

TreeNode *root = NULL;

void buildTree();
void insertFromChild(TreeNode*, int);
void insertFromRoot(int);
void destroyTree(TreeNode*);
void preorderPrint(TreeNode*);
void printLeaves(TreeNode*);

int main() {
    setlocale(LC_ALL, "rus");

    buildTree();
    //preorderPrint(root); // Вывод ключей всех узлов в прямом порядке
    printLeaves(root); // Вывод ключей всех листьев
    destroyTree(root);
    return 0;
}

void insertFromChild(TreeNode *leaf, int key) {
    if (key < leaf->data) {
        if (leaf->left != NULL)
            insertFromChild(leaf->left, key);
        else {
            leaf->left = new TreeNode;
            leaf->left->data = key;
            leaf->left->left = NULL;
            leaf->left->right = NULL;
        }
    }
    else {
        if (leaf->right != NULL)
            insertFromChild(leaf->right, key);
        else {
            leaf->right = new TreeNode;
            leaf->right->data = key;
            leaf->right->left = NULL;
            leaf->right->right = NULL;
        }
    }
}

void insertFromRoot(int key) {
    if (root != NULL) {
        insertFromChild(root, key);
    }
    else {
        root = new TreeNode;
        root->data = key;
        root->left = NULL;
        root->right = NULL;
    }
}

void buildTree() {
    int n;
    cout << "Enter count of elements to insert in bintree:\n";
    cin >> n;
    cout << "Input elements:\n";
    for (int i = 0; i < n; i++) {
        int req;
        cin >> req;
        insertFromRoot(req);
    }
}

void destroyTree(TreeNode *leaf) {
    if (leaf != NULL) {
        destroyTree(leaf->left);
        destroyTree(leaf->right);
        delete leaf;
    }
}

void preorderPrint(TreeNode *root) {
    if (root == NULL) {
        return;
    }
    cout << root->data << ' ';
    preorderPrint(root->left);
    preorderPrint(root->right);
}

void printLeaves(TreeNode *root) {
    if (root == NULL) {
        return;
    }

    if (root->left == NULL && root->right == NULL) {
        cout << root->data << ' ';
    }
    printLeaves(root->left);
    printLeaves(root->right);
}