简体繁体中英

Max. number of rotations while inserting a new element into n-element red black tree

原文 2014-02-10 18:37:47 1 1 red-black-tree/ tree-rotation

What is the maximum number of rotations while inserting a new element into n -element Red Black Tree?

If I'm correct, insertion that does not violate rules of RBT requries maximum of 2 rotations (2 cases). Assuming that's it, is O(1) also a correct answer?

If that's right, confirm it and please tell me, what requires maximum of 3 rotations?

1 answers

A maximum of 3 operations(or 2 rotations) are needed when implementing a Red-Black Tree correctly. For example the central BST shown in this image will need 3 operations to make it confirm to the Red Black BST's rules.

该图显示了需要进行3次操作的情况

_{Image taken from Robert Sedgewick's slides from this MOOC.} .

Inserting element into left leaning black red tree c++

Red Black Tree - max number of rotations needed for K insertions and K deletions?

Inserting into Augmented Red Black Tree

Inserting into Red-Black Tree

Given a red-black tree on n nodes, what is the maximum number of red nodes on any root to leaf path?

Inserting in RED-BLACK TREE in Julia language

Insert elements into a red/black tree that just require color changes and no rotations?

Max integer with same strings, in a red black tree

Java TreeSet method that controls insertion of element into Red-Black tree

How to create red black tree with max height?

暂无

The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.

Related Question Inserting element into left leaning black red tree c++ Red Black Tree - max number of rotations needed for K insertions and K deletions? Inserting into Augmented Red Black Tree Inserting into Red-Black Tree Given a red-black tree on n nodes, what is the maximum number of red nodes on any root to leaf path? Inserting in RED-BLACK TREE in Julia language Insert elements into a red/black tree that just require color changes and no rotations? Max integer with same strings, in a red black tree Java TreeSet method that controls insertion of element into Red-Black tree How to create red black tree with max height?

Related Tags

Max. number of rotations while inserting a new element into n-element red black tree

Question

1 answers

solution1 0 ACCPTED 2014-03-21 12:55:37

solution1
0 ACCPTED 2014-03-21 12:55:37