org.tinygroup.binarytree
Interface BinaryTree<T extends Comparable<T>>

All Known Implementing Classes:

BinaryTreeImpl

public interface BinaryTree<T extends Comparable<T>>

Created by IntelliJ IDEA.
User: luoguo
Date: 11-3-31 Time: 上午11:10
To change this template use File | Settings | File Templates.

Field Summary

static int	DLR_ORDER
static int	LDR_ORDER
static int	LRD_ORDER

Method Summary

BinaryTree<T>	add(T t) 增加一个节点
void	foreach(Processor<T> process) 对每个节点执行操作
void	foreach(Processor<T> process, int mode) 用指定的遍历方式对每一个节点执行操作
T	getData() 返回当前节点数据
BinaryTreeImpl<T>	getParent()
int	height() 获取树的高度
void	remove(T t) 删除指定结点子树
BinaryTree<T>	search(T find)
int	size() 求树的节点数
AVLTree<T>	toAVLTree() 转换为平衡二叉树

Field Detail

DLR_ORDER

static final int DLR_ORDER

See Also:

Constant Field Values

LDR_ORDER

static final int LDR_ORDER

See Also:

Constant Field Values

LRD_ORDER

static final int LRD_ORDER

See Also:

Constant Field Values

Method Detail

search

BinaryTree<T> search(T find)

add

BinaryTree<T> add(T t)

增加一个节点

Parameters:

t -

getData

T getData()

返回当前节点数据

Returns:

remove

void remove(T t)

删除指定结点子树

Parameters:

t -

foreach

void foreach(Processor<T> process)

对每个节点执行操作

Parameters:

process -

foreach

void foreach(Processor<T> process,
             int mode)

用指定的遍历方式对每一个节点执行操作

Parameters:

process -

mode - 前序、后序、中序

getParent

BinaryTreeImpl<T> getParent()

size

int size()

求树的节点数

Returns:

height

int height()

获取树的高度

Returns:

toAVLTree

AVLTree<T> toAVLTree()

转换为平衡二叉树

Returns: