Class: Tree::BinaryTreeNode

Provides a Binary tree implementation. This tree node allows only two child nodes (left and right childs). It also provides direct access to the left and right children, including assignment to the same.

Methods

add isLeftChild? isRightChild? leftChild leftChild= rightChild rightChild= swap_children

Public Instance methods

add(child)

Adds the specified child node to the receiver node. The child node‘s parent is set to be the receiver. The child nodes are added in the order of addition, i.e., the first child added becomes the left node, and the second child will be the second node. If only one child is present, then this will be the left child.

isLeftChild?()

Returns true if this is the left child of its parent. Always returns false if this is the root node.

isRightChild?()

Returns true if this is the right child of its parent. Always returns false if this is the root node.

leftChild()

Returns the left child node. Note that left Child == first Child

leftChild=(child)

Sets the left child. If a previous child existed, it is replaced.

rightChild()

Returns the right child node. Note that right child == last child unless there is only one child. Returns nil if the right child does not exist.

rightChild=(child)

Sets the right child. If a previous child existed, it is replaced.

swap_children()

Swaps the left and right children with each other