In Huffman encoding, one is built based on the frequency of characters, and a finite one with n vertices will have exactly n-1 edges.
The "Merkle hash" variety is used to ensure data integrity, while the B-star variety guarantees two-thirds fullness at all but one point. Another named after Fibonacci has order n-1 to the left and n-2 to the right. In Huffman encoding, one is built based on the frequency of characters, and a finite one with n vertices will have exactly n-1 edges. This structure is defined as a connected graph with no cycles. For 10 points, name this data structure that also comes in "red-black" and "binary search" varieties, and consists of a root at the top and childless "leaves" at the bottom.
The "Merkle hash" variety is used to ensure data integrity, while the B-star variety guarantees two-thirds fullness at all but one point.
{tree} [accept {binary search tree} before mentioned]