How are nodes and elements organized within a binary search tree?

In a binary search tree (BST), each node contains a value and references to two children: left and right.

• All values in the left subtree of a node are less than the value of the node.
• All values in the right subtree of a node are greater than the value of the node.

This property of ordering allows efficient operations such as search, insertion, and deletion.

The node structure typically includes:

class Node {
    int value;
    Node left;
    Node right;

    Node(int value) {
        this.value = value;
        left = null;
        right = null;
    }
}

Thus, the tree is organized recursively: each node is the root of its subtree, where the ordering rule is maintained.