object

bintree

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

author:
Paulo Moura and Paul Fodor
version:
2.1
date:
2010/4/2
compilation flags:
static, context_switching_calls
implements:
public dictionaryp
extends:
public compound

Public interface

preorder/2

Preorder tree traversal.

compilation flags:
static
template:
preorder(Tree,List)
mode – number of proofs:
preorder(@tree,-list) – one

inorder/2

compilation flags:
static
mode – number of proofs:
inorder(@tree,-list) – one

postorder/2

compilation flags:
static
mode – number of proofs:
postorder(@tree,-list) – one

Protected interface

(see related entities)

Private predicates

(see related entities)

Operators

(none)

Remarks

(none)