Binary Search Tree

• A binary search tree is a tree with some requirements

  • The left child is <= the parent node

  • The right child is > the parent node

Code Structure

struct node {
    int data;
    struct node *leftChild;
    struct node *rightChild;
}

Operations

• Search

• Insertion

• Traversal (pre-order, in-order, post-order, level-order)

https://www.tutorialspoint.com/data\_structures\_algorithms/binary\_search\_tree.htm