Wednesday 3 November 2021

Binary Search Tree Application | BST Applications

There are so many applications of binary search tree which are as follows.
  1. It is used to implement dictionary.
  2. It is used to implement multilevel indexing in DATABASE.
  3. To implement Huffman Coding Algorithm.
  4. It is used to implement searching Algorithm.
  5. Implementing routing table in router.
  6. Data compression code
  7. Implementation of Expression parsers and expression solvers
  8. BST used in Unix kernels for managing a set of virtual memory areas (VMAs).
  9. It is helpful in maintaining a sorted stream of data.
  10. TreeMap and TreeSet data structures are internally implemented using self-balancing BSTs.

0 comments :

Post a Comment

Note: only a member of this blog may post a comment.

Machine Learning

More

Advertisement

Java Tutorial

More

UGC NET CS TUTORIAL

MFCS
COA
PL-CG
DBMS
OPERATING SYSTEM
SOFTWARE ENG
DSA
TOC-CD
ARTIFICIAL INT

C Programming

More

Python Tutorial

More

Data Structures

More

computer Organization

More
Top