Scribd
Upload
63 views2 pages

Here Is Another Example. The Insertion Sequence Is: Single Rot. Left at 50

The document describes an insertion sequence into a binary search tree: 50, 25, 10, 5, 7, 3, 30, 20, 8, 15 are inserted with single and double rotations left and right, and additions of 30, 20, 8 without needing rebalancing of the tree.

Uploaded by

nithyarevathi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
63 views2 pages

Here Is Another Example. The Insertion Sequence Is: Single Rot. Left at 50

The document describes an insertion sequence into a binary search tree: 50, 25, 10, 5, 7, 3, 30, 20, 8, 15 are inserted with single and double rotations left and right, and additions of 30, 20, 8 without needing rebalancing of the tree.

Uploaded by

nithyarevathi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Here is another example. The insertion sequence is: 50, 25, 10, 5, 7, 3, 30, 20, 8, 15 single rot.

left at 50

double rot. left at 10

single rot. left at 25

add(30), add(20), add(8)

need no

rebalancing

doubl e rot. right at 7

You might also like