Binary_Search_tree.cpp

#include<iostream>
using namespace std;

struct Node{
    int value;
    struct Node* left;
    struct Node* right;
};

struct Node* root = NULL;

void insertNode(int value) {
    struct Node* newNode = new Node();
    newNode->value = value;
    newNode->left = newNode->right = NULL;

    if (root == NULL) {
        root = newNode;
        return;
    }

    struct Node* current = root;
    struct Node* parent = NULL;

    while (current != NULL) {
        parent = current;
        if (value < current->value) {
            current = current->left;
        } else {
            current = current->right;
        }
    }

    if (value < parent->value) {
        parent->left = newNode;
    } else {
        parent->right = newNode;
    }
}

void nodeTravers(struct Node* root) {
    if (root == NULL)
        return;
    cout << root->value << " ";
    nodeTravers(root->left);
    nodeTravers(root->right);
}

int main() {
    insertNode(40);
    insertNode(20);
    insertNode(55);
    insertNode(48);
    insertNode(10);
    insertNode(11);
    insertNode(65);
    nodeTravers(root);
    return 0;
}