Overview

Excerpt from Twists, Turns, Cascades, Deque Conjecture, and Scanning Theorem They proved that, in an amortized sense and up to a constant factor, the splay tree is as efficient as many of the balanced search trees and the static optimal binary search tree for processing a sequence of dictionary operations. They and Tarjan [7] made the following conjectures concerning the performance of the splay tree: Conjecture 1 (dynamic optimality conjecture Consider an arbitrary sequence of m searches of items in an n-node binary search tree. Let tsa the minimum time required to execute this sequence of searches on any self-adjusting binary search tree, assuming that each search costs (1+the accessed item's depth) and that each rotation costs 1. Then, t'he cost of performing this sequence of accesses on the splay tree is O(n tsa). About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

Full Product Details

9781332094561

Table of Contents

Reviews

Author Information

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available