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
|
/* $Id: avl_RemoveNode.cpp.h $ */
/** @file
* kAVLRemove2 - Remove specific node (by pointer) from an AVL tree.
*/
/*
* Copyright (C) 2006-2019 Oracle Corporation
*
* This file is part of VirtualBox Open Source Edition (OSE), as
* available from http://www.virtualbox.org. This file is free software;
* you can redistribute it and/or modify it under the terms of the GNU
* General Public License (GPL) as published by the Free Software
* Foundation, in version 2 as it comes in the "COPYING" file of the
* VirtualBox OSE distribution. VirtualBox OSE is distributed in the
* hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
*
* The contents of this file may alternatively be used under the terms
* of the Common Development and Distribution License Version 1.0
* (CDDL) only, as it comes in the "COPYING.CDDL" file of the
* VirtualBox OSE distribution, in which case the provisions of the
* CDDL are applicable instead of those of the GPL.
*
* You may elect to license modified versions of this file under the
* terms and conditions of either the GPL or the CDDL or both.
*/
/**
* Removes the specified node from the tree.
*
* @returns Pointer to the removed node (NULL if not in the tree)
* @param ppTree Pointer to the AVL-tree root structure.
* @param pNode Pointer to the node to be removed.
*
* @remark This implementation isn't the most efficient, but it's relatively
* short and easier to manage.
*/
KAVL_DECL(PKAVLNODECORE) KAVL_FN(RemoveNode)(PPKAVLNODECORE ppTree, PKAVLNODECORE pNode)
{
#ifdef KAVL_EQUAL_ALLOWED
/*
* Find the right node by key together with the parent node.
*/
KAVLKEY const Key = pNode->Key;
PKAVLNODECORE pParent = NULL;
PKAVLNODECORE pCurNode = KAVL_GET_POINTER_NULL(ppTree);
if (!pCurNode)
return NULL;
while (KAVL_NE(pCurNode->Key, Key))
{
pParent = pCurNode;
if (KAVL_G(pCurNode->Key, Key))
{
if (pCurNode->pLeft != KAVL_NULL)
pCurNode = KAVL_GET_POINTER(&pCurNode->pLeft);
else
return NULL;
}
else
{
if (pCurNode->pRight != KAVL_NULL)
pCurNode = KAVL_GET_POINTER(&pCurNode->pRight);
else
return NULL;
}
}
if (pCurNode != pNode)
{
/*
* It's not the one we want, but it could be in the duplicate list.
*/
while (pCurNode->pList != KAVL_NULL)
{
PKAVLNODECORE pNext = KAVL_GET_POINTER(&pCurNode->pList);
if (pNext == pNode)
{
if (pNode->pList != KAVL_NULL)
KAVL_SET_POINTER(&pCurNode->pList, KAVL_GET_POINTER(&pNode->pList));
else
pCurNode->pList = KAVL_NULL;
pNode->pList = KAVL_NULL;
return pNode;
}
pCurNode = pNext;
}
return NULL;
}
/*
* Ok, it's the one we want alright.
*
* Simply remove it if it's the only one with they Key, if there are
* duplicates we'll have to unlink it and insert the first duplicate
* in our place.
*/
if (pNode->pList == KAVL_NULL)
KAVL_FN(Remove)(ppTree, pNode->Key);
else
{
PKAVLNODECORE pNewUs = KAVL_GET_POINTER(&pNode->pList);
pNewUs->uchHeight = pNode->uchHeight;
if (pNode->pLeft != KAVL_NULL)
KAVL_SET_POINTER(&pNewUs->pLeft, KAVL_GET_POINTER(&pNode->pLeft));
else
pNewUs->pLeft = KAVL_NULL;
if (pNode->pRight != KAVL_NULL)
KAVL_SET_POINTER(&pNewUs->pRight, KAVL_GET_POINTER(&pNode->pRight));
else
pNewUs->pRight = KAVL_NULL;
if (pParent)
{
if (KAVL_GET_POINTER_NULL(&pParent->pLeft) == pNode)
KAVL_SET_POINTER(&pParent->pLeft, pNewUs);
else
KAVL_SET_POINTER(&pParent->pRight, pNewUs);
}
else
KAVL_SET_POINTER(ppTree, pNewUs);
}
return pNode;
#else
/*
* Delete it, if we got the wrong one, reinsert it.
*
* This ASSUMS that the caller is NOT going to hand us a lot
* of wrong nodes but just uses this API for his convenience.
*/
KAVLNODE *pRemovedNode = KAVL_FN(Remove)(pRoot, pNode->Key);
if (pRemovedNode == pNode)
return pRemovedNode;
KAVL_FN(Insert)(pRoot, pRemovedNode);
return NULL;
#endif
}
|
