Block, SkipCaptcha, Upload, Automoderated users, Check users, delete, edit, Moderators, move, oversight, protect, rollback
19,323
edits
Changes
Jump to navigation
Jump to search
mLine 4:
Line 4: − +
category
Binary trees are traditionally used in the implementation of [[Huffman encoding]]. They are also used in the [[sorting]] algorithms [[heapsort]] and [[mergesort]]. Certain complex algorithms, such as [[MapReduce]], also make heavy use of binary trees. Finally, the binary tree can be used to represent certain dynamic processes, such as the distribution pattern of a file in a [[peer-to-peer]] network or the [[genealogy|genealogical]] history of a person who is the product of a long line of two-parent families.
Binary trees are traditionally used in the implementation of [[Huffman encoding]]. They are also used in the [[sorting]] algorithms [[heapsort]] and [[mergesort]]. Certain complex algorithms, such as [[MapReduce]], also make heavy use of binary trees. Finally, the binary tree can be used to represent certain dynamic processes, such as the distribution pattern of a file in a [[peer-to-peer]] network or the [[genealogy|genealogical]] history of a person who is the product of a long line of two-parent families.
[[Category:Data structures]]
[[Category:Data Structures]]