Methods

<< (Tree::TreeNode)
<=> (Tree::TreeNode)
[] (Tree::TreeNode)
add (Tree::BinaryTreeNode)
add (Tree::TreeNode)
breadth (Tree::TreeNode)
breadth_each (Tree::TreeNode)
children (Tree::TreeNode)
depth (Tree::TreeNode)
detached_copy (Tree::TreeNode)
each (Tree::TreeNode)
each_leaf (Tree::TreeNode)
firstChild (Tree::TreeNode)
firstSibling (Tree::TreeNode)
freezeTree! (Tree::TreeNode)
hasChildren? (Tree::TreeNode)
hasContent? (Tree::TreeNode)
isFirstSibling? (Tree::TreeNode)
isLastSibling? (Tree::TreeNode)
isLeaf? (Tree::TreeNode)
isLeftChild? (Tree::BinaryTreeNode)
isOnlyChild? (Tree::TreeNode)
isRightChild? (Tree::BinaryTreeNode)
isRoot? (Tree::TreeNode)
lastChild (Tree::TreeNode)
lastSibling (Tree::TreeNode)
leftChild (Tree::BinaryTreeNode)
leftChild= (Tree::BinaryTreeNode)
length (Tree::TreeNode)
marshal_dump (Tree::TreeNode)
marshal_load (Tree::TreeNode)
new (Tree::TreeNode)
nextSibling (Tree::TreeNode)
nodeDepth (Tree::TreeNode)
nodeHeight (Tree::TreeNode)
parentage (Tree::TreeNode)
preordered_each (Tree::TreeNode)
previousSibling (Tree::TreeNode)
printTree (Tree::TreeNode)
remove! (Tree::TreeNode)
removeAll! (Tree::TreeNode)
removeFromParent! (Tree::TreeNode)
rightChild (Tree::BinaryTreeNode)
rightChild= (Tree::BinaryTreeNode)
root (Tree::TreeNode)
siblings (Tree::TreeNode)
size (Tree::TreeNode)
swap_children (Tree::BinaryTreeNode)
to_s (Tree::TreeNode)