A binary search tree is a data structure consisting of a set of orderd linked nodes that represent a hierarchical tree structure. Each node is linked to others via parent-children relationship. Any given node can have at most two children (left and right) The first node in the binary searchTree is the root, whereas nodes without any children are the leaves.
Sort: