1 | /* $Id: kAvlGetWithParent.h 2 2007-11-16 16:07:14Z bird $ */
|
---|
2 | /** @file
|
---|
3 | * kAvlTmpl - Templated AVL Trees, Get Node With Parent.
|
---|
4 | */
|
---|
5 |
|
---|
6 | /*
|
---|
7 | * Copyright (c) 2007 knut st. osmundsen <[email protected]>
|
---|
8 | *
|
---|
9 | * This file is part of kStuff.
|
---|
10 | *
|
---|
11 | * kStuff is free software; you can redistribute it and/or
|
---|
12 | * modify it under the terms of the GNU Lesser General Public
|
---|
13 | * License as published by the Free Software Foundation; either
|
---|
14 | * version 2.1 of the License, or (at your option) any later version.
|
---|
15 | *
|
---|
16 | * kStuff is distributed in the hope that it will be useful,
|
---|
17 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
18 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
---|
19 | * Lesser General Public License for more details.
|
---|
20 | *
|
---|
21 | * You should have received a copy of the GNU Lesser General Public
|
---|
22 | * License along with kStuff; if not, write to the Free Software
|
---|
23 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
---|
24 | *
|
---|
25 | *
|
---|
26 | * As a special exception, since this is a source file and not a header
|
---|
27 | * file, you are granted permission to #include this file as you wish
|
---|
28 | * without this in itself causing the resulting program or whatever to be
|
---|
29 | * covered by the LGPL license. This exception does not however invalidate
|
---|
30 | * any other reasons why the resulting program/whatever should not be
|
---|
31 | * covered the LGPL or GPL.
|
---|
32 | */
|
---|
33 |
|
---|
34 |
|
---|
35 | /**
|
---|
36 | * Gets a node from the tree and its parent node (if any).
|
---|
37 | * The tree remains unchanged.
|
---|
38 | *
|
---|
39 | * @returns Pointer to the node holding the given key.
|
---|
40 | * @param ppTree Pointer to the AVL-tree root node pointer.
|
---|
41 | * @param ppParent Pointer to a variable which will hold the pointer to the partent node on
|
---|
42 | * return. When no node is found, this will hold the last searched node.
|
---|
43 | * @param Key Key value of the node which is to be found.
|
---|
44 | */
|
---|
45 | KAVL_DECL(KAVLNODE *) KAVL_FN(GetWithParent)(KAVLTREEPTR *ppTree, KAVLNODE **ppParent, KAVLKEY Key)
|
---|
46 | {
|
---|
47 | register KAVLNODE *pNode = KAVL_GET_POINTER_NULL(ppTree);
|
---|
48 | register KAVLNODE *pParent = NULL;
|
---|
49 |
|
---|
50 | while ( pNode != NULL
|
---|
51 | && KAVL_NE(pNode->mKey, Key))
|
---|
52 | {
|
---|
53 | pParent = pNode;
|
---|
54 | if (KAVL_G(pNode->mKey, Key))
|
---|
55 | pNode = KAVL_GET_POINTER_NULL(&pNode->mpLeft);
|
---|
56 | else
|
---|
57 | pNode = KAVL_GET_POINTER_NULL(&pNode->mpRight);
|
---|
58 | }
|
---|
59 |
|
---|
60 | *ppParent = pParent;
|
---|
61 | return pNode;
|
---|
62 | }
|
---|
63 |
|
---|