object

bintree

Simple binary tree implementation of the dictionary protocol. Uses standard order to compare keys.

Availability:
logtalk_load(dictionaries(loader))
Author: Paulo Moura and Paul Fodor
Version: 2:11:1
Date: 2022-05-05
Compilation flags:
static, context_switching_calls
Implements:
Extends:
public term
Uses:
Remarks:
(none)

Public predicates

preorder/2

Preorder tree traversal.

Compilation flags:
static
Template:
preorder(Tree,List)
Mode and number of proofs:
preorder(@tree,-list) - one

inorder/2

Inorder tree traversal.

Compilation flags:
static
Template:
inorder(Tree,List)
Mode and number of proofs:
inorder(@tree,-list) - one

postorder/2

Postorder tree traversal.

Compilation flags:
static
Template:
postorder(Tree,List)
Mode and number of proofs:
postorder(@tree,-list) - one

Protected predicates

(no local declarations; see entity ancestors if any)

Private predicates

(no local declarations; see entity ancestors if any)

Operators

(none)

See also

avltree, rbtree