What are the applications of binary trees? -

I am thinking that what specific applications of binary trees are, can you give some real examples

binary-tree is meaningless - they are not a data structure, but a family of data structures, With all the different display characteristics Although it is true that unbalanced binary trees search for self-balance binary trees perform badly, many binary trees (like tries to binary ) for which "balance" has no meaning.

Applications of binary tree

• - Many and sets in libraries in many applications used Data such as objects is constantly being accessed, such as search applications.
• - To determine the video game used in almost every 3d, what objects need to render.
• - Router-tables are used in almost every high-bandwidth router to store.
• - The p2p program and specialized image-sign in which a hash needs to be verified, but the full file is not available.
• - Used to implement efficient priority-queues, which are used for scheduling processes in many operating systems, quality- service in router, and A * (AI- Path-searching algorithms used in the app are used in hip-sort, including robotics and video games, ices) .
• () - Used in compression algorithms, such as .jpeg and .mp3 file formats.
• - Used in cryptographic applications
• - Random data structure used in wireless networking and memory allocation
• - Generate a tree of pseudo-random number.
• - Created by (inherent) calculator to parse the compilers and expressions.
• - However, most databases use some form of B-tree to store data on the drive, which is often used to keep data in all (most) memory -Using the paper.

Offer.

To move m nodes, from one level to another, with a balanced (binary) binary tree, a comparison is required, and for total There are log_2 (m) levels, Log_2 (m) comparison.

On the contrary, a n-ary tree wil go to the next level to log_2 (n) compare (using a binary search) Required since there are log_n (m) total levels, search must be entered as log_2 (n) * log_n (m) = log_2 (m) Comparison will require total. Therefore, although the N-ori trees are more complex, they do not give any benefit in terms of the required total comparison.

(However, the N-Rosa trees are still useful in the niche-states. Examples come to mind immediately and other place-split trees, where only two nodes Using the partition is made unnecessarily complicated; and used in many databases, where the limited aspect is not how much comparison is done at each level, but how many nodes are left to the hard drive Can be loaded in R)