Home | History | Annotate | Download | only in stdlib

Lines Matching full:subtree

1821   <= x < 0x140 for the top nose) in the left subtree and the larger
1822 half (0x140 <= x < 0x180) in the right subtree. This is, of course,
1825 Using these rules, each node's left subtree contains all smaller
1826 sizes than its right subtree. However, the node at the root of each
1827 subtree has no particular ordering relationship to either. (The
1828 dividing line between the subtree sizes is based on trie relation.)
3679 tchunkptr rst = 0; /* The deepest untaken right subtree */
3693 t = rst; /* set t to least subtree holding sizes > nb */
3710 while (t != 0) { /* find smallest of tree or subtree */