Problem Statement

A Binary Search Tree (BST) is a tree in which -

• The left sub-tree of a node has a key less than or equal to its parent node's key.

• The right sub-tree of a node has a key greater than to its parent node's key.

The system allows the following features:

. User Input

. Insertion

. Search(Maximum,Minimum,AnyKey)

. Deletion

. Traversal(Pre-order,In-order,Post-order)

The system contains the following functions:

. createNode()

. insert()

. search()

. preOrderTraversal()

. inOrderTraversal()

. postOrderTraversal()

. searchmax()

. searchmin()

. findMax()

. Delete ()