Binary Search Tree Research Paper

539 Words2 Pages

Name: Ahmed Iqbal
Roll No: 12k-2031
Section: R1

Practical 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 algorithm to accomplish efficient routes having many stops. Binary search tree is also the backbone to image recognition software to pick objects or faces out of a pixel image.
In BST we can easily found an element in O (log n) times.

2. B-Trees

If we take this in a practical point of view B-Tree offers you a guarantee an access time of less than 10ms even for extremely large datasets.
The B-Tree gives some useful characteristics:
Transactions for automatically executing a few operations in one or more B-trees.
Where a...

More about Binary Search Tree Research Paper

Open Document