19
edits
Changes
Jump to navigation
Jump to search
New page: A '''binary treee''' is one of the fundamental data structures of computer science, along with the array, the index, and the look-up table. The prima...
A '''binary treee''' is one of the [[fundamentalism|fundamental]] [[data structure]]s of [[computer science]], along with the [[array]], the [[index]], and the [[look-up table]]. The primary distinguishing features of a binary tree data structure are that it is tree-shaped, and that it consists solely of [[binary]] data (therefore the binary tree, unlike the list and the hash, is a ''homogeneous'' data structure).
==Applications==
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 [[genealology|genealological]] history of a person who is the product of a long line of two-parent families (for example, [[Mary]], but not [[Jesus]]).
[[Category:Data structures]]
==Applications==
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 [[genealology|genealological]] history of a person who is the product of a long line of two-parent families (for example, [[Mary]], but not [[Jesus]]).
[[Category:Data structures]]