object

# `bintree`

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

Author: Paulo Moura and Paul Fodor
Version: 2.9
Date: 2019/5/17
Compilation flags:
`static, context_switching_calls`
Implements:
`public` dictionaryp
Extends:
`public` compound
Uses:
list
Remarks:
(none)

- Public predicates

  - `preorder/2`

  - `inorder/2`

  - `postorder/2`

- Protected predicates

- Private predicates

- Operators

## 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`

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 predicates

(see entity ancestors)

## Private predicates

(see entity ancestors)

## Operators

(none)

See also

avltree, rbtree