public class BinaryTree<T> {
private T root;// 根节点
private BinaryTree<T> lTree;//左子树
private BinaryTree<T> rTree;//右子树
public BinaryTree() {
}
public BinaryTree(T t) {
root = t;
}
public BinaryTree(T t, BinaryTree<T> lTree, BinaryTree<T> rTree) {
root = t;
this.lTree = lTree;
this.rTree = rTree;
}
public T getData() {
return root;
}
public void setData(T t) {
root = t;
}
public BinaryTree<T> getLeftChild() {
return lTree;
}
public BinaryTree<T> getRightChild() {
return rTree;
}
public void setRightChild(BinaryTree<T> tree) {
rTree = tree;
}
public void setLeftChild(BinaryTree<T> tree) {
lTree = tree;
}
public void removeLeftChild() {
lTree = null;
}
public void removeRightChild() {
rTree = null;
}
/**
* 先序遍历,前序遍历:根节点->左子树->右子树
*/
public void preOrderTreverse() {
if (root != null) {
System.out.print(root);
}
if (lTree != null) {
lTree.preOrderTreverse();
}
if (rTree != null) {
rTree.preOrderTreverse();
}
}
/**
* 中序遍历:左子树->根节点->右子树
*/
public void inOrderTreverse() {
if (lTree != null) {
lTree.inOrderTreverse();
}
if (root != null) {
System.out.print(root);
}
if (rTree != null) {
rTree.inOrderTreverse();
}
}
/**
* 后序遍历:左子树->右子树->根节点
*/
public void postOrderTreverse() {
if (lTree != null) {
lTree.postOrderTreverse();
}
if (rTree != null) {
rTree.postOrderTreverse();
}
if (root != null) {
System.out.print(root);
}
}
/**
* 取得树的节点总数
*/
public int getNodeCount() {
int count = 0;
if (root != null) {
count++;
}
if (lTree != null) {
count += lTree.getNodeCount();
}
if (rTree != null) {
count += rTree.getNodeCount();
}
return count;
}
public static void main(String[] args) {
BinaryTree<Character> hTree = new BinaryTree<Character>('H');
BinaryTree<Character> gTree = new BinaryTree<Character>('G');
BinaryTree<Character> fTree = new BinaryTree<Character>('F');
fTree.setLeftChild(hTree);
BinaryTree<Character> eTree = new BinaryTree<Character>('E');
BinaryTree<Character> dTree = new BinaryTree<Character>('D');
dTree.setRightChild(gTree);
BinaryTree<Character> cTree = new BinaryTree<Character>('C');
cTree.setRightChild(fTree);
BinaryTree<Character> bTree = new BinaryTree<Character>('B');
bTree.setLeftChild(dTree);
bTree.setRightChild(eTree);
BinaryTree<Character> aTree = new BinaryTree<Character>('A');
aTree.setLeftChild(bTree);
aTree.setRightChild(cTree);
System.out.print("先序遍历:");
aTree.preOrderTreverse();
System.out.print("\n中序遍历:");
aTree.inOrderTreverse();
System.out.print("\n后序遍历:");
aTree.postOrderTreverse();
System.out.println("\n"+aTree.getNodeCount());
}
}
转载于:https://my.oschina.net/u/2360415/blog/548269