Supernode Binary Search Trees
Published in International Journal of Foundations of Computer Science • Jun 1, 2003
Authors:,
Haejae Jung
Sartaj Sahni
Abstract
Balanced binary search tree structures such as AVL, red-black, and splay trees store exactly one element per node. We propose supernode versions of these structures in which each node may have a large number of elements. Some properties of supernode binary search tree structures are established. Exp...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!