binary_tree

class BinaryTree < Object

The old BinaryTree that we've come to know and love.

Constants

Node	A Node is an element in a BinaryTree. It has 4 members: left, right, parent, and value.

Public Methods

size

length

length is an alias for size.

root

initialize()

Create a new BinaryTree

clear()

Clear all the elements from the tree.

insert_left(parent, value)

Insert an element into the tree, on the left side of node.

parent	the parent of the new node.
value	the value of the new node.

Returns: the node that was inserted

insert_right(parent, value)

Insert an element into the tree, on the left side of node.

parent	the parent of the new node.
value	the value of the new node.

Returns: the node that was inserted

insert_root(left, right, value)

Insert an element into the tree, on the left side of node.

left	the left node of the new root.
right	the right node of the new root.
value	the value of the new root.

Returns: the new root.

delete_node(node)

Delete a node from the tree. The children must be re-inserted into the tree.

Returns: 1 if the node was the right child, -1 if the node was the left child, and 0 if the node was the root

each(node=@root, &block)

Iterate through all the elements in the BinaryTree, in order.

Returns: the last value from yield.

each_pair

each_pair is an alias for each.

reverse_each(node=@root, &block)

Iterate through all the elements in the BinaryTree, in order.

Returns: the last value from yield.

reverse_each_pair

reverse_each_pair is an alias for reverse_each.

empty?()

Determine whether a BinaryTree is empty.

Returns: true if the BinaryTree has no elements, false otherwise

clone()

Mixins

Enumerable
EnumerableContainer
PairEnumerableContainer

Protected Methods

root=

size=

Requires