非表示:
キーワード:
-
要旨:
Summary We discuss two simple strategies for constructing binary search trees:
Place the most frequently occurring name at the root of the tree, then proceed
similary on the subtrees and choose the root so as to equalize the total weight
of the left and right subtrees as much as possible, then proceed similarly on
the subtres. While the former rule may yield extremely inefficient search
trees, the latter rule always produces nearly optimal trees.
