View source for r7.0.0:Enum lfds700 btree au absolute position

{{DISPLAYTITLE:enum lfds700_btree_au_absolute_position}}
==Source File==
 └───liblfds700
     └───inc
         └───liblfds700
                 lfds700_btree_addonly_unbalanced.h

==Enum==
 enum lfds700_btree_au_absolute_position
 {
   LFDS700_BTREE_AU_ABSOLUTE_POSITION_ROOT,
   LFDS700_BTREE_AU_ABSOLUTE_POSITION_SMALLEST_IN_TREE,
   LFDS700_BTREE_AU_ABSOLUTE_POSITION_LARGEST_IN_TREE
 };

==Values==
''LFDS700_BTREE_AU_ABSOLUTE_POSITION_ROOT''
: Indicate the root element of the tree - the physical root, i.e. the first element linked into the tree.  The root element has no particular or noteworthy logical value.
''LFDS700_BTREE_AU_ABSOLUTE_POSITION_SMALLEST_IN_TREE''
: Indicates the smallest element of tree (the leftmost element from the root).
''LFDS700_BTREE_AU_ABSOLUTE_POSITION_LARGEST_IN_TREE''
: Indicates the largest element of tree (the rightmost element from the root).

==Notes==
Used by ''[[r7.0.0:function lfds700_btree_au_get_by_absolute_position|lfds700_btree_au_get_by_absolute_position]]'' and ''[[r7.0.0:function lfds700_btree_au_get_by_absolute_position_and_then_by_relative_position|lfds700_btree_au_get_by_absolute_position_and_then_by_relative_position]]'' to select an element from a btree.

An inorder walk, from smallest to largest, is performed by getting ''LFDS700_BTREE_AU_ABSOLUTE_POSITION_SMALLEST_IN_TREE'' and then repeatedly following the direction ''LFDS700_BTREE_AU_RELATIVE_POSITION_NEXT_LARGER_ELEMENT_IN_ENTIRE_TREE''.  (Flip the ''SMALLEST'' and ''LARGEST'' to walk from largest to smallest.)

==See Also==
* [[r7.0.0:Binary Tree (add-only, unbalanced)|Binary Tree (add-only, unbalanced)]]