binary tree - (btree) A tree in which each node has at most two successors
or child nodes. In Haskell this could be represented asdata BTree a = NilTree | Node a (BTree a) (BTree a) See also balanced tree. |

Browse

binary file

binary large object

Binary logarithms

Binary measure

Binary nomenclature

binary notation

binary number system

binary numeration system

binary operation

binary package

Binary scale

binary search

binary star

Binary Synchronous Transmission

binary system

Binary theory

**-- binary tree --**

Binate

Binaural

binaurally

Binbashi

Bind

bind off

bind over

bindable

Binder

binder board

binder's board

Bindery

Bindheimite

Binding

Binding beam

binding energy

binary large object

Binary logarithms

Binary measure

Binary nomenclature

binary notation

binary number system

binary numeration system

binary operation

binary package

Binary scale

binary search

binary star

Binary Synchronous Transmission

binary system

Binary theory

Binate

Binaural

binaurally

Binbashi

Bind

bind off

bind over

bindable

Binder

binder board

binder's board

Bindery

Bindheimite

Binding

Binding beam

binding energy