com.google.common.collect

Class BinaryTreeTraverser<T>

java.lang.Object

com.google.common.collect.TreeTraverser<T>

com.google.common.collect.BinaryTreeTraverser<T>

@Beta
 @GwtCompatible
public abstract class BinaryTreeTraverser<T>
extends TreeTraverser<T>

A variant of TreeTraverser for binary trees, providing additional traversals specific to binary trees.

Since:

15.0

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
private class	BinaryTreeTraverser.InOrderIterator
private class	BinaryTreeTraverser.PostOrderIterator
private class	BinaryTreeTraverser.PreOrderIterator

Constructor Summary

Constructors

Constructor and Description
BinaryTreeTraverser()

Method Summary

Modifier and Type	Method and Description
java.lang.Iterable<T>	children(T root) Returns the children of this node, in left-to-right order.
FluentIterable<T>	inOrderTraversal(T root)
abstract Optional<T>	leftChild(T root) Returns the left child of the specified node, or Optional.absent() if the specified node has no left child.
(package private) UnmodifiableIterator<T>	postOrderIterator(T root)
(package private) UnmodifiableIterator<T>	preOrderIterator(T root)
private static <T> void	pushIfPresent(java.util.Deque<T> stack, Optional<T> node)
abstract Optional<T>	rightChild(T root) Returns the right child of the specified node, or Optional.absent() if the specified node has no right child.

Methods inherited from class com.google.common.collect.TreeTraverser

breadthFirstTraversal, postOrderTraversal, preOrderTraversal, using

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

BinaryTreeTraverser

public BinaryTreeTraverser()

Method Detail

leftChild

public abstract Optional<T> leftChild(T root)

Returns the left child of the specified node, or Optional.absent() if the specified node has no left child.

rightChild

public abstract Optional<T> rightChild(T root)

Returns the right child of the specified node, or Optional.absent() if the specified node has no right child.

children

public final java.lang.Iterable<T> children(T root)

Returns the children of this node, in left-to-right order.

Specified by:

children in class TreeTraverser<T>

preOrderIterator

UnmodifiableIterator<T> preOrderIterator(T root)

Overrides:

preOrderIterator in class TreeTraverser<T>

postOrderIterator

UnmodifiableIterator<T> postOrderIterator(T root)

Overrides:

postOrderIterator in class TreeTraverser<T>

inOrderTraversal

public final FluentIterable<T> inOrderTraversal(T root)

pushIfPresent

private static <T> void pushIfPresent(java.util.Deque<T> stack,
                                      Optional<T> node)