BST stands for Binary Search Tree is a basic tree structure used to keep data in binary searchable format. On every compare, one side of tree is pruned which helps in achieving the searching performance similar to binary search. Since it uses linked nodes to represent each data item, hence insertion
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected