迁移至svn

zhao

2021-07-19 8347f2fbddbd25369359dcb2da1233ac48a19fdc

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
using System;
using System.Collections.Generic;
using System.Text;
 
namespace QiHe.CodeLib
{
    ///<summary>
    ///A red-black tree must satisfy these properties:
    ///1. The root is black. 
    ///2. All leaves are black. 
    ///3. Red nodes can only have black children. 
    ///4. All paths from a node to its leaves contain the same number of black nodes.
    ///</summary>
    public class RedBlackTree<TItem> : BinarySearchTreeBase<TItem, RedBlackTreeNode<TItem>>
        where TItem : IComparable<TItem>
    {
        public override RedBlackTreeNode<TItem> Nil
        {
            get { return RedBlackTreeNode<TItem>.Nil; }
        }
 
        public override void Insert(RedBlackTreeNode<TItem> node)
        {
            base.Insert(node);
            node.Color = NodeColor.Red;
            FixupAfterInsert(node);
        }
 
        /// <summary>
        /// restores the red-black properties to the search tree
        /// </summary>
        /// <param name="node"></param>
        private void FixupAfterInsert(RedBlackTreeNode<TItem> node)
        {
            while (node.Parent.Color == NodeColor.Red)
            {
                if (node.Parent.IsLeftChild)
                {
                    RedBlackTreeNode<TItem> uncle = node.Parent.Parent.Right;
                    // case 1
                    if (uncle.Color == NodeColor.Red)
                    {
                        uncle.Color = NodeColor.Black;
                        node.Parent.Color = NodeColor.Black;
                        node.Parent.Parent.Color = NodeColor.Red;
                        node = node.Parent.Parent;
                    }
                    else
                    {
                        // case 2
                        if (node.IsRightChild)
                        {
                            node = node.Parent;
                            RotateLeft(node);
                        }
                        // case 3
                        node.Parent.Color = NodeColor.Black;
                        node.Parent.Parent.Color = NodeColor.Red;
                        RotateRight(node.Parent.Parent);
                    }
                }
                else // "right" and "left" exchanged
                {
                    RedBlackTreeNode<TItem> uncle = node.Parent.Parent.Left;
                    // case 1
                    if (uncle.Color == NodeColor.Red)
                    {
                        uncle.Color = NodeColor.Black;
                        node.Parent.Color = NodeColor.Black;
                        node.Parent.Parent.Color = NodeColor.Red;
                        node = node.Parent.Parent;
                    }
                    else
                    {
                        // case 2
                        if (node.IsLeftChild)
                        {
                            node = node.Parent;
                            RotateRight(node);
                        }
                        // case 3
                        node.Parent.Color = NodeColor.Black;
                        node.Parent.Parent.Color = NodeColor.Red;
                        RotateLeft(node.Parent.Parent);
                    }
                }
            }
            Root.Color = NodeColor.Black;
        }
 
        public override RedBlackTreeNode<TItem> Delete(RedBlackTreeNode<TItem> node)
        {
            RedBlackTreeNode<TItem> deletedNode = base.Delete(node);
 
            RedBlackTreeNode<TItem> child = Nil;
 
            RedBlackTreeNode<TItem> parent = deletedNode.Parent;
            if (parent != Nil)
            {
                child = deletedNode.IsLeftChild ? parent.Left : parent.Right;
            }
 
            if (deletedNode.Color == NodeColor.Black)
            {
                FixupAfterDelete(child);
            }
            return deletedNode;
        }
 
 
        /// <summary>
        /// restores the red-black properties to the search tree
        /// </summary>
        /// <param name="node"></param>
        private void FixupAfterDelete(RedBlackTreeNode<TItem> node)
        {
            while (node != Root && node.Color == NodeColor.Black)
            {
                if (node.IsLeftChild)
                {
                    RedBlackTreeNode<TItem> sibling = node.Parent.Right;
                    if (sibling.Color == NodeColor.Red)
                    {
                        sibling.Color = NodeColor.Black;
                        node.Parent.Color = NodeColor.Red;
                        RotateLeft(node.Parent);
                        sibling = node.Parent.Right;
                    }
                    if (sibling.Left.Color == NodeColor.Black && sibling.Right.Color == NodeColor.Black)
                    {
                        sibling.Color = NodeColor.Red;
                        node = node.Parent;
                    }
                    else
                    {
                        if (sibling.Right.Color == NodeColor.Black)
                        {
                            sibling.Left.Color = NodeColor.Black;
                            sibling.Color = NodeColor.Red;
                            RotateRight(sibling);
                            sibling = node.Parent.Right;
                        }
 
                        sibling.Color = node.Parent.Color;
                        node.Parent.Color = NodeColor.Black;
                        sibling.Right.Color = NodeColor.Black;
                        RotateLeft(node.Parent);
                        node = Root;
                    }
                }
                else // same as code above with right and left swapped
                {
                    RedBlackTreeNode<TItem> sibling = node.Parent.Left;
                    if (sibling.Color == NodeColor.Red)
                    {
                        sibling.Color = NodeColor.Black;
                        node.Parent.Color = NodeColor.Red;
                        RotateRight(node.Parent);
                        sibling = node.Parent.Left;
                    }
                    if (sibling.Left.Color == NodeColor.Black && sibling.Right.Color == NodeColor.Black)
                    {
                        sibling.Color = NodeColor.Red;
                        node = node.Parent;
                    }
                    else
                    {
                        if (sibling.Left.Color == NodeColor.Black)
                        {
                            sibling.Right.Color = NodeColor.Black;
                            sibling.Color = NodeColor.Red;
                            RotateLeft(sibling);
                            sibling = node.Parent.Left;
                        }
 
                        sibling.Color = node.Parent.Color;
                        node.Parent.Color = NodeColor.Black;
                        sibling.Left.Color = NodeColor.Black;
                        RotateRight(node.Parent);
                        node = Root;
                    }
                }
            }
            node.Color = NodeColor.Black;
        }
    }
}