RTL_AVL_TABLE structure (ntddk.h)
The RTL_AVL_TABLE structure contains file system-specific data for an Adelson-Velsky/Landis (AVL) tree. An AVL tree ensures a more balanced, shallower tree implementation than a splay tree implementation of a generic table (RTL_GENERIC_TABLE).
RTL_AVL_TABLE is opaque, so cannot be directly manipulated. Drivers must use the support routines that are described in the Remarks section to manipulate RTL_AVL_TABLE values.
Syntax
typedef struct _RTL_AVL_TABLE {
RTL_BALANCED_LINKS BalancedRoot;
PVOID OrderedPointer;
ULONG WhichOrderedElement;
ULONG NumberGenericTableElements;
ULONG DepthOfTree;
PRTL_BALANCED_LINKS RestartKey;
ULONG DeleteCount;
PRTL_AVL_COMPARE_ROUTINE CompareRoutine;
PRTL_AVL_ALLOCATE_ROUTINE AllocateRoutine;
PRTL_AVL_FREE_ROUTINE FreeRoutine;
PVOID TableContext;
} RTL_AVL_TABLE;
Members
BalancedRoot
Reserved for system use.
OrderedPointer
Reserved for system use.
WhichOrderedElement
Reserved for system use.
NumberGenericTableElements
Reserved for system use.
DepthOfTree
Reserved for system use.
RestartKey
Reserved for system use.
DeleteCount
Reserved for system use.
CompareRoutine
Reserved for system use.
AllocateRoutine
Reserved for system use.
FreeRoutine
Reserved for system use.
TableContext
Reserved for system use.
Remarks
To initialize an AVL table package, you allocate a buffer that is at least sizeof(RTL_AVL_TABLE) bytes in size. You can then use this buffer to receive the initialized AVL table structure from a call to the RtlInitializeGenericTableAvl routine. Use the following routines to manipulate the table:
Requirements
| Requirement | Value |
|---|---|
| Minimum supported client | This structure is available on Windows XP and later. |
| Header | ntddk.h (include Ntddk.h) |
See also
RtlDeleteElementGenericTableAvl
RtlEnumerateGenericTableLikeADirectory
RtlEnumerateGenericTableWithoutSplayingAvl
RtlInsertElementGenericTableAvl
RtlInsertElementGenericTableFullAvl
RtlLookupElementGenericTableAvl
RtlLookupElementGenericTableFullAvl