Removes newChild from its parent and makes it a child of this node by adding it to the end of this node's child array.

  Removes newChild from its parent and makes it a child of
this node by adding it to the end of this node's child array.
Parameters:
- newChild - node to add as a child of this node
Throws:
- IllegalArgumentException - if newChild is null
- IllegalStateException - if this node does not allow children
See Also: DefaultMutableTreeNode.insert(javax.swing.tree.MutableTreeNode, int),

  Creates and returns an enumeration that traverses the subtree rooted at this node in breadth-first order.

  Creates and returns an enumeration that traverses the subtree rooted at this node in breadth-first order. The first node returned by the enumeration's nextElement() method is this node.

Modifying the tree by inserting, removing, or moving a node invalidates any enumerations created before the modification.
Returns: an enumeration for traversing the tree in breadth-first order
See Also: DefaultMutableTreeNode.depthFirstEnumeration(),

  Creates and returns a forward-order enumeration of this node's children.

  Creates and returns a forward-order enumeration of this node's
children. Modifying this node's child array invalidates any child
enumerations created before the modification.
Returns: an Enumeration of this node's children

  Overridden to make clone public.

  Overridden to make clone public. Returns a shallow copy of this node;
the new node has no parent or children and has a reference to the same
user object, if any.
Returns: a copy of this node

  Creates and returns an enumeration that traverses the subtree rooted at this node in depth-first order.

  Creates and returns an enumeration that traverses the subtree rooted at this node in depth-first order. The first node returned by the enumeration's nextElement() method is the leftmost leaf. This is the same as a postorder traversal.

Modifying the tree by inserting, removing, or moving a node invalidates any enumerations created before the modification.
Returns: an enumeration for traversing the tree in depth-first order
See Also: DefaultMutableTreeNode.breadthFirstEnumeration(), DefaultMutableTreeNode.postorderEnumeration(),

  Returns true if this node is allowed to have children.

  Returns true if this node is allowed to have children.
Returns: true if this node allows children, else false

  Returns the child in this node's child array that immediately follows aChild, which must be a child of this node.

  Returns the child in this node's child array that immediately
follows aChild, which must be a child of this node. If
aChild is the last child, returns null. This method
performs a linear search of this node's children for
aChild and is O(n) where n is the number of children; to
traverse the entire array of children, use an enumeration instead.
Returns: the child of this node that immediately follows aChild
Throws:
- IllegalArgumentException - if aChild is null or is not a child of this node
See Also: DefaultMutableTreeNode.children,

  Returns the child at the specified index in this node's child array.

  Returns the child at the specified index in this node's child array.
Returns: the TreeNode in this node's child array at the specified index
Parameters:
- index - an index into this node's child array
Throws:
- ArrayIndexOutOfBoundsException - if index is out of bounds

  Returns the child in this node's child array that immediately precedes aChild, which must be a child of this node.

  Returns the child in this node's child array that immediately
precedes aChild, which must be a child of this node. If
aChild is the first child, returns null. This method
performs a linear search of this node's children for aChild
and is O(n) where n is the number of children.
Returns: the child of this node that immediately precedes aChild
Throws:
- IllegalArgumentException - if aChild is null or is not a child of this node

  Returns the number of children of this node.

  Returns the number of children of this node.
Returns: an int giving the number of children of this node

  Returns the depth of the tree rooted at this node -- the longest distance from this node to a leaf.

  Returns the depth of the tree rooted at this node -- the longest
distance from this node to a leaf. If this node has no children,
returns 0. This operation is much more expensive than
getLevel() because it must effectively traverse the entire
tree rooted at this node.
Returns: the depth of the tree whose root is this node
See Also: DefaultMutableTreeNode.getLevel(),

  Returns this node's first child.

  Returns this node's first child. If this node has no children,
throws NoSuchElementException.
Returns: the first child of this node
Throws:
- NoSuchElementException - if this node has no children

  Finds and returns the first leaf that is a descendant of this node -- either this node or its first child's first leaf.

  Finds and returns the first leaf that is a descendant of this node --
either this node or its first child's first leaf.
Returns this node if it is a leaf.
Returns: the first leaf in the subtree rooted at this node
See Also: DefaultMutableTreeNode.isLeaf(), DefaultMutableTreeNode.isNodeDescendant(javax.swing.tree.DefaultMutableTreeNode),

  Returns the index of the specified child in this node's child array.

  Returns the index of the specified child in this node's child array.
If the specified node is not a child of this node, returns
-1. This method performs a linear search and is O(n)
where n is the number of children.
Returns: an int giving the index of the node in this node's child array, or -1 if the specified node is a not a child of this node
Parameters:
- aChild - the TreeNode to search for among this node's children
Throws:
- IllegalArgumentException - if aChild is null

  Returns this node's last child.

  Returns this node's last child. If this node has no children,
throws NoSuchElementException.
Returns: the last child of this node
Throws:
- NoSuchElementException - if this node has no children

  Finds and returns the last leaf that is a descendant of this node -- either this node or its last child's last leaf.

  Finds and returns the last leaf that is a descendant of this node --
either this node or its last child's last leaf.
Returns this node if it is a leaf.
Returns: the last leaf in the subtree rooted at this node
See Also: DefaultMutableTreeNode.isLeaf(), DefaultMutableTreeNode.isNodeDescendant(javax.swing.tree.DefaultMutableTreeNode),

  Returns the total number of leaves that are descendants of this node.

  Returns the total number of leaves that are descendants of this node.
If this node is a leaf, returns 1. This method is O(n)
where n is the number of descendants of this node.
Returns: the number of leaves beneath this node
See Also: DefaultMutableTreeNode.isNodeAncestor(javax.swing.tree.TreeNode),

  Returns the number of levels above this node -- the distance from the root to this node.

  Returns the number of levels above this node -- the distance from
the root to this node. If this node is the root, returns 0.
Returns: the number of levels above this node
See Also: DefaultMutableTreeNode.getDepth(),

  Returns the leaf after this node or null if this node is the last leaf in the tree.

  Returns the leaf after this node or null if this node is the last leaf in the tree.

In this implementation of the MutableNode interface, this operation is very inefficient. In order to determine the next node, this method first performs a linear search in the parent's child-list in order to find the current node.

That implementation makes the operation suitable for short traversals from a known position. But to traverse all of the leaves in the tree, you should use depthFirstEnumeration to enumerate the nodes in the tree and use isLeaf on each node to determine which are leaves.
Returns: returns the next leaf past this node
See Also: DefaultMutableTreeNode.depthFirstEnumeration(), DefaultMutableTreeNode.isLeaf(),

  Returns the node that follows this node in a preorder traversal of this node's tree.

  Returns the node that follows this node in a preorder traversal of this
node's tree. Returns null if this node is the last node of the
traversal. This is an inefficient way to traverse the entire tree; use
an enumeration, instead.
Returns: the node that follows this node in a preorder traversal, or null if this node is last
See Also: DefaultMutableTreeNode.preorderEnumeration(),

  Returns the next sibling of this node in the parent's children array.

  Returns the next sibling of this node in the parent's children array.
Returns null if this node has no parent or is the parent's last child.
This method performs a linear search that is O(n) where n is the number
of children; to traverse the entire array, use the parent's child
enumeration instead.
Returns: the sibling of this node that immediately follows this node
See Also: DefaultMutableTreeNode.children,

  Returns this node's parent or null if this node has no parent.

  Returns this node's parent or null if this node has no parent.
Returns: this node's parent TreeNode, or null if this node has no parent

  Returns the path from the root, to get to this node.

  Returns the path from the root, to get to this node. The last
element in the path is this node.
Returns: an array of TreeNode objects giving the path, where the first element in the path is the root and the last element is this node.

  Builds the parents of node up to and including the root node, where the original node is the last element in the returned array.

  Builds the parents of node up to and including the root node,
where the original node is the last element in the returned array.
The length of the returned array gives the node's depth in the
tree.
Returns: an array of TreeNodes giving the path from the root to the specified node
Parameters:
- aNode - the TreeNode to get the path for
- depth - an int giving the number of steps already taken towards the root (on recursive calls), used to size the returned array

  Returns the leaf before this node or null if this node is the first leaf in the tree.

  Returns the leaf before this node or null if this node is the first leaf in the tree.

In this implementation of the MutableNode interface, this operation is very inefficient. In order to determine the previous node, this method first performs a linear search in the parent's child-list in order to find the current node.

That implementation makes the operation suitable for short traversals from a known position. But to traverse all of the leaves in the tree, you should use depthFirstEnumeration to enumerate the nodes in the tree and use isLeaf on each node to determine which are leaves.
Returns: returns the leaf before this node
See Also: DefaultMutableTreeNode.depthFirstEnumeration(), DefaultMutableTreeNode.isLeaf(),

  Returns the node that precedes this node in a preorder traversal of this node's tree.

  Returns the node that precedes this node in a preorder traversal of
this node's tree. Returns null if this node is the
first node of the traversal -- the root of the tree.
This is an inefficient way to
traverse the entire tree; use an enumeration, instead.
Returns: the node that precedes this node in a preorder traversal, or null if this node is the first
See Also: DefaultMutableTreeNode.preorderEnumeration(),

  Returns the previous sibling of this node in the parent's children array.

  Returns the previous sibling of this node in the parent's children
array. Returns null if this node has no parent or is the parent's
first child. This method performs a linear search that is O(n) where n
is the number of children.
Returns: the sibling of this node that immediately precedes this node

  Returns the root of the tree that contains this node.

  Returns the root of the tree that contains this node. The root is
the ancestor with a null parent.
Returns: the root of the tree that contains this node
See Also: DefaultMutableTreeNode.isNodeAncestor(javax.swing.tree.TreeNode),

  Returns the nearest common ancestor to this node and aNode.

  Returns the nearest common ancestor to this node and aNode.
Returns null, if no such ancestor exists -- if this node and
aNode are in different trees or if aNode is
null. A node is considered an ancestor of itself.
Returns: nearest ancestor common to this node and aNode, or null if none
Parameters:
- aNode - node to find common ancestor with
See Also: DefaultMutableTreeNode.isNodeAncestor(javax.swing.tree.TreeNode), DefaultMutableTreeNode.isNodeDescendant(javax.swing.tree.DefaultMutableTreeNode),

  Returns the number of siblings of this node.

  Returns the number of siblings of this node. A node is its own sibling
(if it has no parent or no siblings, this method returns
1).
Returns: the number of siblings of this node

  Returns this node's user object.

  Returns this node's user object.
Returns: the Object stored at this node by the user
See Also: DefaultMutableTreeNode.setUserObject(java.lang.Object), DefaultMutableTreeNode.toString(),

  Returns the user object path, from the root, to get to this node.

  Returns the user object path, from the root, to get to this node.
If some of the TreeNodes in the path have null user objects, the
returned path will contain nulls.

  Removes newChild from its present parent (if it has a parent), sets the child's parent to this node, and then adds the child to this node's child array at index childIndex.

  Removes newChild from its present parent (if it has a
parent), sets the child's parent to this node, and then adds the child
to this node's child array at index childIndex.
newChild must not be null and must not be an ancestor of
this node.
Parameters:
- newChild - the MutableTreeNode to insert under this node
- childIndex - the index in this node's child array where this node is to be inserted
Throws:
- ArrayIndexOutOfBoundsException - if childIndex is out of bounds
- IllegalArgumentException - if newChild is null or is an ancestor of this node
- IllegalStateException - if this node does not allow children
See Also: DefaultMutableTreeNode.isNodeDescendant(javax.swing.tree.DefaultMutableTreeNode),

  Returns true if this node has no children.

  Returns true if this node has no children. To distinguish between
nodes that have no children and nodes that cannot have
children (e.g. to distinguish files from empty directories), use this
method in conjunction with getAllowsChildren
Returns: true if this node has no children
See Also: DefaultMutableTreeNode.getAllowsChildren(),

  Returns true if anotherNode is an ancestor of this node -- if it is this node, this node's parent, or an ancestor of this node's parent.

  Returns true if anotherNode is an ancestor of this node
-- if it is this node, this node's parent, or an ancestor of this
node's parent. (Note that a node is considered an ancestor of itself.)
If anotherNode is null, this method returns false. This
operation is at worst O(h) where h is the distance from the root to
this node.
Returns: true if this node is a descendant of anotherNode
Parameters:
- anotherNode - node to test as an ancestor of this node
See Also: DefaultMutableTreeNode.isNodeDescendant(javax.swing.tree.DefaultMutableTreeNode), DefaultMutableTreeNode.getSharedAncestor(javax.swing.tree.DefaultMutableTreeNode),

  Returns true if aNode is a child of this node.

  Returns true if aNode is a child of this node. If
aNode is null, this method returns false.
Returns: true if aNode is a child of this node; false if aNode is null

  Returns true if anotherNode is a descendant of this node -- if it is this node, one of this node's children, or a descendant of one of this node's children.

  Returns true if anotherNode is a descendant of this node
-- if it is this node, one of this node's children, or a descendant of
one of this node's children. Note that a node is considered a
descendant of itself. If anotherNode is null, returns
false. This operation is at worst O(h) where h is the distance from the
root to anotherNode.
Returns: true if this node is an ancestor of anotherNode
Parameters:
- anotherNode - node to test as descendant of this node
See Also: DefaultMutableTreeNode.isNodeAncestor(javax.swing.tree.TreeNode), DefaultMutableTreeNode.getSharedAncestor(javax.swing.tree.DefaultMutableTreeNode),

  Returns true if and only if aNode is in the same tree as this node.

  Returns true if and only if aNode is in the same tree
as this node. Returns false if aNode is null.
Returns: true if aNode is in the same tree as this node; false if aNode is null
See Also: DefaultMutableTreeNode.getSharedAncestor(javax.swing.tree.DefaultMutableTreeNode), DefaultMutableTreeNode.getRoot(),

  Returns true if anotherNode is a sibling of (has the same parent as) this node.

  Returns true if anotherNode is a sibling of (has the
same parent as) this node. A node is its own sibling. If
anotherNode is null, returns false.
Returns: true if anotherNode is a sibling of this node
Parameters:
- anotherNode - node to test as sibling of this node

  Returns true if this node is the root of the tree.

  Returns true if this node is the root of the tree. The root is
the only node in the tree with a null parent; every tree has exactly
one root.
Returns: true if this node is the root of its tree

  Creates and returns an enumeration that follows the path from ancestor to this node.

  Creates and returns an enumeration that follows the path from ancestor to this node. The enumeration's nextElement() method first returns ancestor, then the child of ancestor that is an ancestor of this node, and so on, and finally returns this node. Creation of the enumeration is O(m) where m is the number of nodes between this node and ancestor, inclusive. Each nextElement() message is O(1).

Modifying the tree by inserting, removing, or moving a node invalidates any enumerations created before the modification.
Returns: an enumeration for following the path from an ancestor of this node to this one
Throws:
- IllegalArgumentException - if ancestor is not an ancestor of this node
See Also: DefaultMutableTreeNode.isNodeAncestor(javax.swing.tree.TreeNode), DefaultMutableTreeNode.isNodeDescendant(javax.swing.tree.DefaultMutableTreeNode),

  Creates and returns an enumeration that traverses the subtree rooted at this node in postorder.

  Creates and returns an enumeration that traverses the subtree rooted at this node in postorder. The first node returned by the enumeration's nextElement() method is the leftmost leaf. This is the same as a depth-first traversal.

Modifying the tree by inserting, removing, or moving a node invalidates any enumerations created before the modification.
Returns: an enumeration for traversing the tree in postorder
See Also: DefaultMutableTreeNode.depthFirstEnumeration(), DefaultMutableTreeNode.preorderEnumeration(),

  Creates and returns an enumeration that traverses the subtree rooted at this node in preorder.

  Creates and returns an enumeration that traverses the subtree rooted at this node in preorder. The first node returned by the enumeration's nextElement() method is this node.

Modifying the tree by inserting, removing, or moving a node invalidates any enumerations created before the modification.
Returns: an enumeration for traversing the tree in preorder
See Also: DefaultMutableTreeNode.postorderEnumeration(),

  Removes the child at the specified index from this node's children and sets that node's parent to null.

  Removes the child at the specified index from this node's children
and sets that node's parent to null. The child node to remove
must be a MutableTreeNode.
Parameters:
- childIndex - the index in this node's child array of the child to remove
Throws:
- ArrayIndexOutOfBoundsException - if childIndex is out of bounds

  Removes aChild from this node's child array, giving it a null parent.

  Removes aChild from this node's child array, giving it a
null parent.
Parameters:
- aChild - a child of this node to remove
Throws:
- IllegalArgumentException - if aChild is null or is not a child of this node

  Removes all of this node's children, setting their parents to null.

  Removes all of this node's children, setting their parents to null.
If this node has no children, this method does nothing.

  Removes the subtree rooted at this node from the tree, giving this node a null parent.

  Removes the subtree rooted at this node from the tree, giving this
node a null parent. Does nothing if this node is the root of its
tree.

  Determines whether or not this node is allowed to have children.

  Determines whether or not this node is allowed to have children. If allows is false, all of this node's children are removed.

Note: By default, a node allows children.
Parameters:
- allows - true if this node is allowed to have children

  Sets this node's parent to newParent but does not change the parent's child array.

  Sets this node's parent to newParent but does not
change the parent's child array. This method is called from
insert() and remove() to
reassign a child's parent, it should not be messaged from anywhere
else.
Parameters:
- newParent - this node's new parent

  Sets the user object for this node to userObject.

  Sets the user object for this node to userObject.
Parameters:
- userObject - the Object that constitutes this node's user-specified data
See Also: DefaultMutableTreeNode.getUserObject(), DefaultMutableTreeNode.toString(),

  Returns the result of sending toString() to this node's user object, or null if this node has no user object.

  Returns the result of sending toString() to this node's
user object, or null if this node has no user object.
See Also: DefaultMutableTreeNode.getUserObject(),