Self-balancing binary search tree Essays

  • Binary Search Tree Research Paper

    539 Words  | 2 Pages

    Applications Of: 1. Binary Search Tree(BST) Binary search tree is used in many applications where information is always entering and leaving, for example, map and set objects in many languages libraries. Storing a set of names, and you look up on that on the basis of the prefix of name basically used in internet routers. Storing a path in a graph and for being able to reverse any subsection of a path in O (log n) is time basically useful in travelling salesman problems. A Binary search tree is the easiest