红黑树(改进版) -- 新增删除节点的方法实现

最新推荐文章于 2024-03-21 10:39:46 发布

置顶 bingbing200x

最新推荐文章于 2024-03-21 10:39:46 发布

阅读量1k

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构 .net 文章标签： null exception string class date 算法

本文链接：https://blog.youkuaiyun.com/bingbing200x/article/details/3831272

.net 同时被 2 个专栏收录

25 篇文章

订阅专栏

数据结构

12 篇文章

订阅专栏

本文介绍了一种红黑树的具体实现方式，并提供了详细的代码示例。此外，还设计了一系列测试用例来验证红黑树的正确性和性能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

红黑树的文章看了很多,但个人感觉这一篇:

http://zh.wikipedia.org/w/index.php?title=%E7%B4%85%E9%BB%91%E6%A8%B9&variant=zh-cn讲的最清楚,有一种豁然开朗的感觉.

其他的文章在网上也找了一些,可是看到一半就想头往墙上撞了,看来技术练到一定程度,语言与文字的表达技巧就非常重要了,呵呵.我是菜鸟啊.看我写的文章都直接给代码,很少写文字.太懒了.以后要多多锻炼.

直接贴出以下代码(如有bug请一定告之,呵呵. mail:bingbing200x@163.com).

红黑树继承了二叉排序树的实现 ..测试用例做的不够全,有朋友如果时间充裕请帮忙多测测,呵呵
#region RotatableBSTree abstract class public class RotateEventArgs<T> : EventArgs where T : IComparable<T> { private BinaryNode<T> _rotateNode; private bool _IsLeftRotate; /// <summary> /// 需要被平衡的节点,也就是旋转时的根节点(支点) /// </summary> public BinaryNode<T> RotateNode { get { return _rotateNode; } set { _rotateNode = value; } } /// <summary> /// 旋转的方向 /// </summary> public bool IsLeftRotate { get { return _IsLeftRotate; } set { _IsLeftRotate = value; } } public RotateEventArgs() { } public RotateEventArgs(BinaryNode<T> balanceNode) { _rotateNode = balanceNode; } } public abstract class RotatableBSTree<T> : BSTree<T>,IBSTree<T> where T : IComparable<T> { protected RotatableBSTree(T data) : base(data) { } protected RotatableBSTree() { } /// <summary> /// 旋转前事件 /// </summary> public event RotateEventHandler PreRotate; /// <summary> /// 旋转后事件 /// </summary> public event RotateEventHandler Rotated; public delegate void RotateEventHandler(RotateEventArgs<T> evnetArg); protected virtual void OnPreRotate(RotateEventArgs<T> eventArg) { if (this.PreRotate != null) PreRotate(eventArg); } protected virtual void OnRotated(RotateEventArgs<T> evnetArg) { if (this.Rotated != null) Rotated(evnetArg); } } #endregion #region RBTree /*********************************************************************************** * 红黑树(BSTree)算法实现 * Date:2009.1.15 * Author:Yabin * *********************************************************************************/ public class RBNode<T> : BinaryNode<T>, IComparable<BinaryNode<T>> where T : IComparable<T> { private bool _isBlack; public RBNode(bool isBlack, T data):base(data) { _isBlack = isBlack; } public RBNode(T data) : base(data) { } public bool IsBlack { get { return _isBlack; } set { _isBlack = value; } } } public class RBTree<T> : RotatableBSTree<T>, IBSTree<T> where T : IComparable<T> { public RBTree(T data) : base(data) { } public RBTree() { } /// <summary> /// 覆盖基类的输出节点信息方法 /// </summary> /// <param name="builder"></param> /// <param name="node"></param> protected override void AddPrintData(StringBuilder builder, BinaryNode<T> node) { base.AddPrintData(builder, node); builder.Append("/"); builder.Append(ToRBNode(node).IsBlack ? "黑" : "红"); } protected override string NodePrintSpace { get { return " "; } } public override bool InsertNode(T data) { RBNode<T> newNode = new RBNode<T>(false, data); if (InsertNode(newNode)) { InsertCase(newNode); return true; } return false; } private RBNode<T> ToRBNode(BinaryNode<T> node) { return (RBNode<T>)node; } protected void L_Rotate(BinaryNode<T> root) { RotateEventArgs<T> arg = new RotateEventArgs<T>(); arg.IsLeftRotate = true; arg.RotateNode = root; OnPreRotate(arg); BinaryNode<T> rp = root.PNode; bool bIsLeftChild = root.IsLeftChild; BinaryNode<T> t = root.RNode; //root.PNode = t; root.RNode = t.LNode; //if (t.LNode != null) // t.LNode.PNode = root; t.LNode = root; if (rp != null) { if (bIsLeftChild) rp.LNode = t; else rp.RNode = t; } else _root = t; OnRotated(arg); } protected void R_Rotate(BinaryNode<T> root) { RotateEventArgs<T> arg = new RotateEventArgs<T>(); arg.IsLeftRotate = false; arg.RotateNode = root; OnPreRotate(arg); BinaryNode<T> rp = root.PNode; bool bIsLeftChild = root.IsLeftChild; BinaryNode<T> t = root.LNode; //root.PNode = t; root.LNode = t.RNode; //if (t.RNode != null) // t.RNode.PNode = root; t.RNode = root; if (rp != null) { if (bIsLeftChild) rp.LNode = t; else rp.RNode = t; } else _root = t; OnRotated(arg); } #region insertcase private void InsertCase(RBNode<T> newNode) { if (newNode.PNode == null) newNode.IsBlack = true; else if (ToRBNode(newNode.PNode).IsBlack) return; else InsertCase_RedUncle(newNode); } /// <summary> /// 父节点和叔节点都为红色时 /// </summary> /// <param name="newNode"></param> private void InsertCase_RedUncle(RBNode<T> newNode) { if (newNode.UncleNode != null && ToRBNode(newNode.UncleNode).IsBlack==false) { ToRBNode(newNode.PNode).IsBlack=true; ToRBNode(newNode.UncleNode).IsBlack = true; RBNode<T> gNode = ToRBNode(newNode.GrandParent); gNode.IsBlack = false; InsertCase(gNode); } else InsertCase_BlackUncle(newNode); } /// <summary> /// 叔父节点为黑色或为空时 /// </summary> /// <param name="newNode"></param> private void InsertCase_BlackUncle(RBNode<T> newNode) { if (newNode.IsInSide)//内侧情况 { if (newNode.IsLeftChild) { this.R_Rotate(newNode.PNode); //note:如果旋转测newNode节点已变 newNode = ToRBNode(newNode.RNode); } else { this.L_Rotate(newNode.PNode); newNode = ToRBNode(newNode.LNode); } } //不是内侧就是外侧情况, //以newNode的爷节点为根旋转 ToRBNode(newNode.PNode).IsBlack = true; ToRBNode(newNode.GrandParent).IsBlack = false; if (newNode.IsLeftChild) this.R_Rotate(newNode.GrandParent); else this.L_Rotate(newNode.GrandParent); } #endregion #region removecase public override bool RemoveNode(T data) { BinaryNode<T> fNode = FindNode(data); BinaryNode<T> remNode = fNode;//真正要删除的节点 if (fNode != null) { //if (fNode.IsLeaf) // return Internel_RemoveNode(fNode); if (fNode.LNode != null && fNode.RNode != null) { BinaryNode<T> temp = fNode.RNode; while (temp.LNode != null) temp = temp.LNode; fNode.Data = temp.Data; Current = temp.PNode; remNode = temp; } //如果右子树最小节点为叶节点 if (remNode.IsLeaf) return Internel_RemoveNode(remNode); //到这里remNode一定只有一个子树 RemoveCase(remNode); return true; } return false; } /// <summary> /// 替换节点 /// </summary> /// <param name="sNode">源节点</param> /// <param name="dNode">替换节点</param> private void ReplaceNode(BinaryNode<T> sNode, BinaryNode<T> dNode) { BinaryNode<T> parent = sNode.PNode; if (parent == null) { dNode.PNode = null; _root = dNode; return; } if (sNode == parent.LNode) parent.LNode = dNode; else parent.RNode = dNode; } private void RemoveCase(BinaryNode<T> remNode) { RBNode<T> nNode = ToRBNode(remNode.LNode == null ? remNode.RNode : remNode.LNode); ReplaceNode(remNode, nNode); if (ToRBNode(remNode).IsBlack) { //如果新节点是红色的 if (!nNode.IsBlack) { nNode.IsBlack = true; return; } //如果新节点替换成根节点则退出 if (nNode.PNode == null) return; RemoveCase_RedSibling(nNode); } } /// <summary> /// 红兄情况 /// </summary> /// <param name="nNode"></param> private void RemoveCase_RedSibling(RBNode<T> nNode) { RBNode<T> sibNode = ToRBNode(nNode.SiblingNode); if (!sibNode.IsBlack) { RBNode<T> pNode = ToRBNode(nNode.PNode); pNode.IsBlack = false; sibNode.IsBlack = true; if (nNode.IsLeftChild) this.R_Rotate(pNode); else this.R_Rotate(pNode); } RemoveCase_BlackSibling(nNode); } /// <summary> /// 黑兄情况(共三种) /// </summary> /// <param name="nNode"></param> private void RemoveCase_BlackSibling(RBNode<T> nNode) { RBNode<T> sibNode = ToRBNode(nNode.SiblingNode); RBNode<T> pNode = ToRBNode(nNode.PNode); RBNode<T> slNode = ToRBNode(sibNode.LNode); RBNode<T> srNode = ToRBNode(sibNode.RNode); if (sibNode.IsBlack && pNode.IsBlack && //1.黑父,s双黑子 slNode.IsBlack && srNode.IsBlack) { sibNode.IsBlack=false; RemoveCase(nNode.PNode); }else if (!pNode.IsBlack && sibNode.IsBlack && //2.红父,s双黑子 slNode.IsBlack && srNode.IsBlack) { sibNode.IsBlack = false; pNode.IsBlack = true; } else if (sibNode.IsBlack)//3.黑兄的子节点有红节点时 { if (!slNode.IsBlack && srNode.IsBlack && nNode.IsLeftChild)//s的左节点为红,n为左孩子时 { sibNode.IsBlack = false; slNode.IsBlack = true; R_Rotate(sibNode); } if (slNode.IsBlack && !srNode.IsBlack && nNode.IsRightChild)//s的右节点为红,n为右孩子时 { sibNode.IsBlack = false; srNode.IsBlack = true; L_Rotate(sibNode); } /*------已经符合情况3的处理部份--------*/ //note:旋转后n的兄弟已经改变 sibNode = ToRBNode(nNode.SiblingNode); sibNode.IsBlack = pNode.IsBlack; pNode.IsBlack = true; if (nNode.IsLeftChild) { ToRBNode(sibNode.RNode).IsBlack = true; L_Rotate(pNode); } else { ToRBNode(sibNode.LNode).IsBlack = true; R_Rotate(pNode); } } } #endregion } #endregion #region rbtree testcase public static class RBTreeTestCase { private static RBTree<int> rbTree; private static string str = string.Empty; static RBTreeTestCase() { rbTree = new RBTree<int>(); rbTree.PreRotate+=new RotatableBSTree<int>.RotateEventHandler(RBTreeTestCase_PreRotate); rbTree.Rotated+=new RotatableBSTree<int>.RotateEventHandler(RBTreeTestCase_Rotated); } static void RBTreeTestCase_Rotated(RotateEventArgs<int> evnetArg) { str += (evnetArg.IsLeftRotate ? "左旋转" : "右旋转") + "节点:" + evnetArg.RotateNode.Data.ToString() + "(后)" + "/n"; str += rbTree.Print() + "/n----------------------------/n"; } static void RBTreeTestCase_PreRotate(RotateEventArgs<int> evnetArg) { str += (evnetArg.IsLeftRotate ? "左旋转" : "右旋转") + "节点:" + evnetArg.RotateNode.Data.ToString() + "(前)" + "/n"; str += rbTree.Print() + "/n----------------------------/n"; } public static void AddNodeAndPrint(int[] data) { try { str = string.Empty; foreach (int i in data) { rbTree.InsertNode(i); str += rbTree.Print() + "/n----------------------------/n"; } System.Windows.Forms.MessageBox.Show(str); } catch (Exception ex) { string str = ex.Message; } } public static void Test() { //TestInsert(); TestRemove(); } public static void TestRemove() { //TestRemove1(); //TestRemove2(); //TestRemove3(); //TestRemove4(); TestRemove5(); } public static void TestRemove1() { rbTree.Insert(new int[] { 10, 9, 18, 13 ,14}); str += rbTree.Print() + "/n----------------------------/n"; rbTree.RemoveNode(10); str += rbTree.Print() + "/n----------------------------/n"; System.Windows.Forms.MessageBox.Show(str); } public static void TestRemove2() { rbTree.Insert(new int[] { 10, 9, 18, 13, 19, 14 }); str += rbTree.Print() + "/n----------------------------/n"; rbTree.RemoveNode(10); str += rbTree.Print() + "/n----------------------------/n"; System.Windows.Forms.MessageBox.Show(str); } public static void TestRemove3() { rbTree.Insert(new int[] { 11, 9, 18, 13}); str += rbTree.Print() + "/n----------------------------/n"; rbTree.RemoveNode(18); rbTree.RemoveNode(13); rbTree.Insert(new int[] { 7, 10}); str += rbTree.Print() + "/n----------------------------/n"; rbTree.RemoveNode(11); str += rbTree.Print() + "/n----------------------------/n"; System.Windows.Forms.MessageBox.Show(str); } public static void TestRemove4() { rbTree.Insert(new int[] { 11, 9, 18, 13 }); str += rbTree.Print() + "/n----------------------------/n"; rbTree.RemoveNode(18); rbTree.RemoveNode(13); rbTree.Insert(new int[] { 7, 10 }); str += rbTree.Print() + "/n----------------------------/n"; rbTree.RemoveNode(9); str += rbTree.Print() + "/n----------------------------/n"; System.Windows.Forms.MessageBox.Show(str); } public static void TestRemove5() { rbTree.Insert(new int[] { 25, 9, 35, 7,10,6,28,27,36,34}); str += rbTree.Print() + "/n----------------------------/n"; rbTree.Insert(new int[] { 38}); str += rbTree.Print() + "/n----------------------------/n"; rbTree.RemoveNode(10); str += rbTree.Print() + "/n----------------------------/n"; rbTree.RemoveNode(9); str += rbTree.Print() + "/n----------------------------/n"; System.Windows.Forms.MessageBox.Show(str); } public static void TestInsert() { try { string str = string.Empty; //AddNodeAndPrint(new int[5] { 6, 3, 2, 4, 1 }); //AddNodeAndPrint(new int[4] { 4, 6, 3, 2 }); //AddNodeAndPrint(new int[4] { 4, 6, 2, 3 }); //AddNodeAndPrint(new int[7] { 6, 3, 1, 4, 0, 2, -1 }); //AddNodeAndPrint(new int[7] { 2, 9, 1, 5, 4, 6, 3 }); AddNodeAndPrint(new int[] { 25, 9, 35, 7, 10, 6, 28, 29 }); } catch (Exception ex) { string strError = ex.Message; } } } #endregion