|
Class: AATreeNode
Object
|
+--BinaryTreeNode
|
+--AATreeNode
- Package:
- stx:libbasic2
- Category:
- Collections-Ordered-Trees
- Version:
- rev:
1.10
date: 2024/04/18 14:21:11
- user: cg
- file: AATreeNode.st directory: libbasic2
- module: stx stc-classLibrary: libbasic2
I represent nodes in an AA tree, which is a form of balanced tree used for storing and retrieving ordered data efficiently.
AA trees are named for Arne Andersson, their inventor.
See details in AATree
copyrightCOPYRIGHT (c) 2009 by eXept Software AG
All Rights Reserved
This software is furnished under a license and may be used
only in accordance with the terms of that license and with the
inclusion of the above copyright notice. This software may not
be provided or otherwise made available to, or used by, any
other person. No title to or ownership of the software is
hereby transferred.
instance creation
-
data: dataArg level: levelArg
-
accessing
-
data: dataArg level: levelIntegerArg
-
-
level
-
-
level: anInteger
-
helpers
-
decrease_level
-
function decrease_level is
-
insert: anObject usingSortBlock: sortBlock
-
function insert is
-
removeValue: oldValue using: equalSelector sortBlock: sortBlock
-
remove a value - returns a new treeNode, or nil if the value is not in the tree
-
skew
-
function skew is
-
split
-
function split is
|