3. 情况4的本质是：把S的黑色给N的祖先，这使得N树的黑色深度加1， SR由红变黑，相当于S的右子树的黑色深度没有变化，从而维持整棵树的红黑性质。
↧
Channel:
《数据结构之红黑树》的评论
X
Are you the publisher?
Claim or
contact us
about this channel.
X
0
Channel Details:
- Title: 《数据结构之红黑树》的评论
- Channel Number: 19501377
- Language: Xhosa
- Registered On: June 28, 2013, 7:47 pm
- Number of Articles: 12
- Latest Snapshot: April 23, 2017, 2:10 am
- RSS URL: http://dongxicheng.org/structure/red-black-tree/feed
- Publisher: http://dongxicheng.org/structure/red-black-tree/
- Description: {关注大规模数据处理，包括Hadoop，YARN，MapReduce，Spark，Mesos等}
- Catalog: //uniguttulate39.rssing.com/catalog.php?indx=19501377
© 2025 //www.rssing.com