binary search tree (bsta binary search tree (bstis tree in which all the nodes follow the below-mentioned properties the left sub-tree of node has key less than or equal to its parent node' key the right sub-tree of node has key greater than to its parent node' key thusbst divides all its sub-trees into two segmentsthe left sub-tree and the right sub-tree and can be defined as left_subtree (keys<node (key<right_subtree (keysrepresentation bst is collection of nodes arranged in way where they maintain bst properties each node has key and an associated value while searchingthe desired key is compared to the keys in bst and if foundthe associated value is retrieved following is pictorial representation of bst we observe that the root node key ( has all less-valued keys on the left sub-tree and the higher valued keys on the right sub-tree basic operations following are the basic operations of tree search searches an element in tree insert inserts an element in tree pre-order traversal traverses tree in pre-order manner in-order traversal traverses tree in an in-order manner post-order traversal traverses tree in post-order manner node