A NEW WEIGHT BALANCED BINARY SEARCH TREE

A New Weight Balanced Binary Search Tree

A New Weight Balanced Binary Search Tree 1

We develop a new class of weight balanced binary search trees called-balanced binary search trees (-BBSTs).-BBSTs are designed to have reduced internal path length. As a result, they are expected to exhibit good search time characteristics. Individual search, insert, and delete operations in an n node-BBST take O(log n) time for 0 < p 2?1. Experimental results comparing the performance of-BBSTs...

The Hidden Binary Search Tree: A Balanced Rotation-Free Search Tree in the AVL RAM Model

In this paper we generalize the definition of"Search Trees"(ST) to enable reference values other than the key of prior inserted nodes. The idea builds on the assumption an $n$-node AVL (or Red-Black) requires to assure $O(\log_2n)$ worst-case search time, namely, a single comparison between two keys takes constant time. This means the size of each key in bits is fixed to $B=c\log_2 n$ ($c\geq1$...

Adjusted Weight-Balanced Binary Tree for IP Routing Table Lookup*

Abstract Various algorithms have recently been proposed for Internet routers to improve the performance of routing table lookup. However, most of previous research effort does not utilize the access frequencies of route entries. Since Internet traffic has significant temporal localities [9]-[11], one could largely improve the performance of routing table lookup by taking advantage of access fre...

A New Class of Balanced Search Trees: Half Balanced Binary Search Trees

— A newclassojbalancedbinary search trees is introduced: thehalf-balancedbinary trees. When used as a node search tree, a hal]-balanced binary tree containing n keys has a height at most 2 lg(n + 2) —2. Algorithms are given for IN SERT and DELETE instructions, having time complexity O(lg n). A remarkable resuit is that at most one local restructuring must be performed during the (leletion or th...