Publisher's Synopsis
Excerpt from Tree Locking on Changing Trees
We must now decide on a set Of Operations powerful enough to introduce arbitrary changes to the tree graph, yet restricted enough to ensure that the graph remain a tree in all intermediate states. B-tree splits and merges, for example, are clearly too restrictive in that they can only produce balanced trees and can not even change the height of any given node. Addition or removal of a single edge, on the other hand.
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.
