Applications of binary trees

Applications of binary trees

The following are the applications of binary trees:

1. Binary Search Tree - Used in many search applications that constantly show and hide data, such as data. For example, map and set objects in many libraries.
2. Binary Space Partition - Used in almost any 3D video game to determine which objects need to be rendered.
3. Binary Tries - Used in almost every high-bandwidth router to store router tables.
4. Syntax Tree - Constructed by compilers and (implicit) calculators to parse expressions.
5. Hash Trees - Used in P2P programs and special image signatures that require a hash to be validated, but the entire file is not available.
6. Heaps - Used to implement efficient priority queues and also used in heap sort.
7. Treap - Randomized data structure for wireless networks and memory allocation.
8. T-Tree - Although most databases use a form of B-tree to store data on the drive, databases that store all (most) data often use T-trees.
9. Huffman Coding Tree (Chip Uni) - Used in compression algorithms, eg. For example, in .jpeg and .mp3.GGM Trees file formats - used in cryptographic applications to generate a tree with pseudo-random numbers.