@Test(expected = TreeNodeException.class) public void testCommonAncestorCurrentNodeIsRootException() { root.commonAncestor(node1); }
public TreeNode<T> commonAncestor(TreeNode<T> node) { String errorMessage = "Unable to find the common ancestor between tree nodes. "; if (node == null) { String message = errorMessage + "The specified tree node is null"; throw new TreeNodeException(message); } if (!this.root().contains(node)) { String message = String.format(errorMessage + "The specified tree node %1$s was not found in the current tree node %2$s", node, this); throw new TreeNodeException(message); } if (this.isRoot() || node.isRoot()) { String message = String.format(errorMessage + "The tree node %1$s is root", this.isRoot() ? this : node); throw new TreeNodeException(message); } if (this.equals(node) || node.isSiblingOf(this)) { return parent(); } int thisNodeLevel = this.level(); int thatNodeLevel = node.level(); return thisNodeLevel > thatNodeLevel ? node.parent() : this.parent(); }
TreeNode implements Iterable<TreeNode<T>>, Serializable, Cloneable { public TreeNode<T> commonAncestor(TreeNode<T> node) { String errorMessage = "Unable to find the common ancestor between tree nodes. "; if (node == null) { String message = errorMessage + "The specified tree node is null"; throw new TreeNodeException(message); } if (!this.root().contains(node)) { String message = String.format(errorMessage + "The specified tree node %1$s was not found in the current tree node %2$s", node, this); throw new TreeNodeException(message); } if (this.isRoot() || node.isRoot()) { String message = String.format(errorMessage + "The tree node %1$s is root", this.isRoot() ? this : node); throw new TreeNodeException(message); } if (this.equals(node) || node.isSiblingOf(this)) { return parent(); } int thisNodeLevel = this.level(); int thatNodeLevel = node.level(); return thisNodeLevel > thatNodeLevel ? node.parent() : this.parent(); } }
TreeNode implements Iterable<TreeNode<T>>, Serializable, Cloneable { public TreeNode<T> commonAncestor(TreeNode<T> node) { String errorMessage = "Unable to find the common ancestor between tree nodes. "; if (node == null) { String message = errorMessage + "The specified tree node is null"; throw new TreeNodeException(message); } if (!this.root().contains(node)) { String message = String.format(errorMessage + "The specified tree node %1$s was not found in the current tree node %2$s", node, this); throw new TreeNodeException(message); } if (this.isRoot() || node.isRoot()) { String message = String.format(errorMessage + "The tree node %1$s is root", this.isRoot() ? this : node); throw new TreeNodeException(message); } if (this.equals(node) || node.isSiblingOf(this)) { return parent(); } int thisNodeLevel = this.level(); int thatNodeLevel = node.level(); return thisNodeLevel > thatNodeLevel ? node.parent() : this.parent(); } TreeNode(T data);  TreeNode(); }
TreeNode implements Iterable<TreeNode<T>>, Serializable, Cloneable { public TreeNode<T> commonAncestor(TreeNode<T> node) { String errorMessage = "Unable to find the common ancestor between tree nodes. "; if (node == null) { String message = errorMessage + "The specified tree node is null"; throw new TreeNodeException(message); } if (!this.root().contains(node)) { String message = String.format(errorMessage + "The specified tree node %1$s was not found in the current tree node %2$s", node, this); throw new TreeNodeException(message); } if (this.isRoot() || node.isRoot()) { String message = String.format(errorMessage + "The tree node %1$s is root", this.isRoot() ? this : node); throw new TreeNodeException(message); } if (this.equals(node) || node.isSiblingOf(this)) { return parent(); } int thisNodeLevel = this.level(); int thatNodeLevel = node.level(); return thisNodeLevel > thatNodeLevel ? node.parent() : this.parent(); } TreeNode(T data);  TreeNode(); abstract Collection<? extends TreeNode<T>> subtrees(); abstract boolean add(TreeNode<T> subtree); abstract boolean dropSubtree(TreeNode<T> subtree); abstract void clear(); abstract TreeNodeIterator iterator(); T data(); void setData(T data); boolean isRoot(); TreeNode<T> root(); TreeNode<T> parent(); boolean isLeaf(); @SuppressWarnings("unchecked") TreeNode<T> find(final T data); Collection<? extends TreeNode<T>> findAll(final T data); boolean hasSubtree(TreeNode<T> subtree); boolean contains(TreeNode<T> node); boolean containsAll(Collection<TreeNode<T>> nodes); boolean remove(TreeNode<T> node); boolean removeAll(Collection<TreeNode<T>> nodes); void traversePreOrder(TraversalAction<TreeNode<T>> action); void traversePostOrder(TraversalAction<TreeNode<T>> action); Collection<TreeNode<T>> preOrdered(); Collection<TreeNode<T>> postOrdered(); Collection<? extends TreeNode<T>> path(TreeNode<T> descendant); TreeNode<T> commonAncestor(TreeNode<T> node); boolean isSiblingOf(TreeNode<T> node); boolean isAncestorOf(TreeNode<T> node); boolean isDescendantOf(TreeNode<T> node); long size(); int height(); int level(); @SuppressWarnings("unchecked") @Override TreeNode<T> clone(); @SuppressWarnings("unchecked") @Override boolean equals(Object obj); @Override int hashCode(); @Override String toString(); }
TreeNode implements Iterable<TreeNode<T>>, Serializable, Cloneable { public TreeNode<T> commonAncestor(TreeNode<T> node) { String errorMessage = "Unable to find the common ancestor between tree nodes. "; if (node == null) { String message = errorMessage + "The specified tree node is null"; throw new TreeNodeException(message); } if (!this.root().contains(node)) { String message = String.format(errorMessage + "The specified tree node %1$s was not found in the current tree node %2$s", node, this); throw new TreeNodeException(message); } if (this.isRoot() || node.isRoot()) { String message = String.format(errorMessage + "The tree node %1$s is root", this.isRoot() ? this : node); throw new TreeNodeException(message); } if (this.equals(node) || node.isSiblingOf(this)) { return parent(); } int thisNodeLevel = this.level(); int thatNodeLevel = node.level(); return thisNodeLevel > thatNodeLevel ? node.parent() : this.parent(); } TreeNode(T data);  TreeNode(); abstract Collection<? extends TreeNode<T>> subtrees(); abstract boolean add(TreeNode<T> subtree); abstract boolean dropSubtree(TreeNode<T> subtree); abstract void clear(); abstract TreeNodeIterator iterator(); T data(); void setData(T data); boolean isRoot(); TreeNode<T> root(); TreeNode<T> parent(); boolean isLeaf(); @SuppressWarnings("unchecked") TreeNode<T> find(final T data); Collection<? extends TreeNode<T>> findAll(final T data); boolean hasSubtree(TreeNode<T> subtree); boolean contains(TreeNode<T> node); boolean containsAll(Collection<TreeNode<T>> nodes); boolean remove(TreeNode<T> node); boolean removeAll(Collection<TreeNode<T>> nodes); void traversePreOrder(TraversalAction<TreeNode<T>> action); void traversePostOrder(TraversalAction<TreeNode<T>> action); Collection<TreeNode<T>> preOrdered(); Collection<TreeNode<T>> postOrdered(); Collection<? extends TreeNode<T>> path(TreeNode<T> descendant); TreeNode<T> commonAncestor(TreeNode<T> node); boolean isSiblingOf(TreeNode<T> node); boolean isAncestorOf(TreeNode<T> node); boolean isDescendantOf(TreeNode<T> node); long size(); int height(); int level(); @SuppressWarnings("unchecked") @Override TreeNode<T> clone(); @SuppressWarnings("unchecked") @Override boolean equals(Object obj); @Override int hashCode(); @Override String toString();  }