bt traverse

#include <iostream>

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

typedef struct Node_t Node;

void traverse_tree(Node *root)
{
    Node *current = root;
    std::cout << current->data << std::endl;
    if(current->left)
    {
        traverse_tree(current->left);
    }
    if(current->right)
    {
        traverse_tree(current->right);
    }
}

int main()
{
    Node *root = new Node;
    root->data = 0;

    Node *n11 = new Node;
    n11->data = 11;
    Node *n12 = new Node;
    n12->data = 12;

    Node *n21 = new Node;
    n21->data = 21;
    Node *n22 = new Node;
    n22->data = 22;
    Node *n23 = new Node;
    n23->data = 23;
    Node *n24 = new Node;
    n24->data = 24;

    root->left = n11;
    root->right = n12;

    n11->left = n21;
    n11->right = n22;

    n12->left = n23;
    n12->right = n24;

    n21->left = n21->right = NULL;
    n22->left = n22->right = NULL;
    n23->left = n23->right = NULL;
    n24->left = n24->right = NULL;

    traverse_tree(root);




    return 0;
}