Uses of Class
net.junaraki.libtree.OrderedTree

Uses of OrderedTree in net.junaraki.libtree

Subclasses of OrderedTree in net.junaraki.libtree

Modifier and Type	Class and Description
class	BinaryTree<E> This class implements a binary tree.

Methods in net.junaraki.libtree that return OrderedTree

Modifier and Type	Method and Description
OrderedTree<E>	OrderedTree.find(E element) Finds a node of the first occurrence of the given element in this tree.
OrderedTree<E>	OrderedTree.findChild(E element) Finds a child of the first occurrence of the given element in this node.
OrderedTree<E>	OrderedTree.getChildAt(int index) Returns the child of this node at the given index.
OrderedTree<E>	OrderedTree.getFirstChild() Returns the first child of this node.
OrderedTree<E>	OrderedTree.getLastChild() Returns the last child of this node.
OrderedTree<E>	OrderedTree.getParent() Returns the parent of this node.
OrderedTree<E>	OrderedTree.getRoot() Returns the root of this tree.

Methods in net.junaraki.libtree that return types with arguments of type OrderedTree

Modifier and Type	Method and Description
java.util.List<OrderedTree<E>>	OrderedTree.getAncestors() Returns a list of ancestors of this node, ordered from the root to the parent of this node.
java.util.List<OrderedTree<E>>	OrderedTree.getChildren() Returns a list of children of this node.
java.util.List<OrderedTree<E>>	OrderedTree.getLeaves() Returns a list of leaves in this tree in a natural order.
java.util.List<OrderedTree<E>>	OrderedTree.getOrderedTreeNodes() Returns a list of all nodes of the type OrderedTree<E> in this tree.
java.util.List<OrderedTree<E>>	OrderedTree.getSiblings() Returns a list of siblings of this node.
java.util.List<OrderedTree<E>>	OrderedTree.getSubtrees() Returns a list of subtrees of this tree.
java.util.List<OrderedTree<E>>	OrderedTree.traverseNodes() Traverses this tree, and returns a list of found nodes in this tree.
java.util.List<OrderedTree<E>>	OrderedTree.traverseNodesLevelOrder() Traverses this tree in the level-order manner, which is breadth-first search (BFS), and returns a list of found nodes.
java.util.List<OrderedTree<E>>	OrderedTree.traverseNodesPostOrder() Traverses this tree in the post-order manner, which is one way of depth-first search (DFS), and returns a list of found nodes.
java.util.List<OrderedTree<E>>	OrderedTree.traverseNodesPreOrder() Traverses this tree in the pre-order manner, which is one way of depth-first search (DFS), and returns a list of found nodes.

Methods in net.junaraki.libtree with parameters of type OrderedTree

Modifier and Type	Method and Description
void	OrderedTree.add(OrderedTree<E> child) Adds the given child to this node.
void	OrderedTree.addChild(OrderedTree<E> child) Adds the given child to this node.
boolean	OrderedTree.hasChild(OrderedTree<E> child) Returns true if this node has the given child.
boolean	OrderedTree.isFirstChild(OrderedTree<E> node) Returns true if the first child of this node is the given node.
boolean	OrderedTree.isLastChild(OrderedTree<E> node) Returns true if the last child of this node is the given node.
void	OrderedTree.removeChild(OrderedTree<E> child) Removes the given child from this node.
void	OrderedTree.setChildAt(int index, OrderedTree<E> child) Sets the given child to this node at the given index.
void	OrderedTree.setParent(OrderedTree<E> parent) Sets the given parent to this node.
boolean	OrderedTree.subsumes(OrderedTree<E> tree) Returns true if the given tree matches this tree or a subtree of the tree.