Why they’re worth studying: One of the major techniques employed in this transformation is the de-
composition of a binary search tree into a series of chains, each of which is formed by linking the parent
node to its heavier child. This closely mirrors the blue/red analysis we did of splay tree operations, yet
converts it from an accounting trick into a real data structure design technique. This would be a great way
to learn more about that technique while also seeing novel ways of simulating binary search trees.
13 / 22
Do'stlaringiz bilan baham: |