Lines Matching defs:leaf
3222 int root, leaf, next, avbl, used, dpth;
3231 leaf = 2;
3233 if (leaf >= n || A[root].m_key < A[leaf].m_key) {
3237 A[next].m_key = A[leaf++].m_key;
3238 if (leaf >= n || (root < next && A[root].m_key < A[leaf].m_key)) {
3242 A[next].m_key = (mz_uint16)(A[next].m_key + A[leaf++].m_key);
8462 // leaf node, the distance between the root and the leaf is the length