Safe Haskell	Safe

BTree

Description

A Module for Binary Trees.

Synopsis

Documentation

A binary tree is either Empty or consists of a Note with at most two direct subtrees.

Constructors

Empty
Node a (BTree a) (BTree a)

Instances

Eq a => Eq (BTree a) #
Methods (==) :: BTree a -> BTree a -> Bool # (/=) :: BTree a -> BTree a -> Bool #
Read a => Read (BTree a) #
Methods readsPrec :: Int -> ReadS (BTree a) # readList :: ReadS [BTree a] # readPrec :: ReadPrec (BTree a) # readListPrec :: ReadPrec [BTree a] #
Show a => Show (BTree a) #
Methods showsPrec :: Int -> BTree a -> ShowS # show :: BTree a -> String # showList :: [BTree a] -> ShowS #

The size of a binary tree is the number of Nodes it contains.

The height of a binary tree is the length of the longest path from the its root to one of its leafs.

Transforming a list into a binary tree of the same structure.

Building a balanced binary tree from a list.

Building a binary search tree from a list.

Turning a binary tree into a list by inorder traversal of nodes.