object

# `bintree`

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

Author: Paulo Moura and Paul Fodor
Version: 2.3
Date: 2018/3/18
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 and number of proofs:
`preorder(@tree,-list)` - `one`

### `inorder/2`

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

### `postorder/2`

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

## Protected interface

(see related entities)

## Private predicates

(see related entities)

## Operators

(none)

## Remarks

(none)

See also

rbtree