day21

二叉树

package datastructure.tree;

import java.util.Arrays;

/**
 * Binary tree with char type elements.
 * 
 * @author Michelle Min MitchelleMin@163.com
 * 
 */

public class BinaryCharTree {

	/**
	 * The value in char.
	 */
	char value;

	/**
	 * The left child.
	 */
	BinaryCharTree leftChild;

	/**
	 * The right child.
	 */
	BinaryCharTree rightChild;

	/**
	 * 
	 * The first constructor.
	 * 
	 * @param paraName
	 *            The value.
	 * 
	 */
	public BinaryCharTree(char paraName) {
		value = paraName;
		leftChild = null;
		rightChild = null;
	}// Of the constructor

	/**
	 * 
	 * The first constructor.
	 * 
	 * @param paraName
	 *            The value.
	 */

	public static BinaryCharTree manualConstructTree() {
		// Step 1.Construct a tree with only one node.
		BinaryCharTree resultTree = new BinaryCharTree('a');

		// Step 2.Construct all nodes The first node is the root.
		// BinaryCharTreeNode tempTreeA = resultTree.root;
		BinaryCharTree tempTreeB = new BinaryCharTree('b');
		BinaryCharTree tempTreeC = new BinaryCharTree('c');
		BinaryCharTree tempTreeD = new BinaryCharTree('d');
		BinaryCharTree tempTreeE = new BinaryCharTree('e');
		BinaryCharTree tempTreeF = new BinaryCharTree('f');
		BinaryCharTree tempTreeG = new BinaryCharTree('g');

		// Step 3.Link all nodes.
		resultTree.leftChild = tempTreeB;
		resultTree.rightChild = tempTreeC;
		tempTreeB.leftChild = tempTreeD;
		tempTreeC.rightChild = tempTreeE;
		tempTreeD.leftChild = tempTreeF;
		tempTreeD.rightChild = tempTreeG;

		return resultTree;
	}// Of manualConstructTree

	/**
	 * 
	 * Pre-order visit.
	 * 
	 */
	public void preOrderVisit() {
		System.out.print("" + value + " ");

		if (leftChild != null) {
			leftChild.preOrderVisit();
		}// Of if
		if (rightChild != null){
			rightChild.preOrderVisit();
		}
	}// Of preOrderVisit

	/**
	 * 
	 * Post-order visit.
	 * 
	 */
	public void inOrderVisit() {
		if (leftChild != null) {
			leftChild.inOrderVisit();
		}// Of if

		System.out.print("" + value + " ");

		if (rightChild != null) {
			rightChild.inOrderVisit();
		}// Of if
	}// Of inOrderVisit

	/**
	 * 
	 * Post-order visit.
	 * 
	 */
	public void postOrderVisit(){
		if (leftChild != null){
			leftChild.postOrderVisit();
		}//Of if
		
		if (rightChild !=  null){
			rightChild.postOrderVisit();
		}
		
		System.out.print("" + value + " ");
	}//Of postOrderVist

	/**
	 * 
	 * Get the depth of the binary tree.
	 * 
	 * @return The depth. It is 1 if there is only one node, i.e., the root.
	 * 
	 */
	public int getDepth() {
		// It is a leap.
		if ((leftChild == null) && (rightChild == null)) {
			return 1;
		}// Of if

		// The depth of the left child.
		int tempLeftDepth = 0;
		if (leftChild != null) {
			tempLeftDepth = leftChild.getDepth();
		}// Of if

		// The depth of the right child.
		int tempRightDepth = 0;
		if (leftChild != null) {
			tempRightDepth = leftChild.getDepth();
		}// Of if

		// The depth should increment by 1.
		if (tempLeftDepth >= tempRightDepth) {
			return tempLeftDepth + 1;
		} else {
			return tempRightDepth + 1;
		}// Of if
	}// Of getDepth

	/**
	 * 
	 * Get the number of nodes.
	 * 
	 * @return The number of nodes.
	 * 
	 */
	public int getNumNodes() {
		// It is a leaf.
		if ((leftChild == null) && (rightChild == null)) {
			return 1;
		}// Of if

		// The number of nodes of the left child.
		int tempLeftNodes = 0;
		if (leftChild != null) {
			tempLeftNodes = leftChild.getNumNodes();
		}// Of if

		// The number of nodes of the right child.
		int tempRightNodes = 0;
		if (rightChild != null) {
			tempRightNodes = rightChild.getNumNodes();
		}// Of if

		// The total number of nodes.
		return tempLeftNodes + tempRightNodes + 1;
	}// Of getNumNodes

	/**
	 * 
	 * The entrance of the program.
	 * 
	 * @param args
	 *            Not used now.
	 * 
	 */
	public static void main(String args[]) {
		BinaryCharTree tempTree = manualConstructTree();
		System.out.println("\r\nPreorder visit:");
		tempTree.preOrderVisit();
		System.out.println("\r\nIn-order visit:");
		tempTree.inOrderVisit();
		System.out.println("\r\nPost-order visit:");
		tempTree.postOrderVisit();

		System.out.println("\r\n\r\n The depth is: " + tempTree.getDepth());
		System.out.println("The number of nodes is: " + tempTree.getNumNodes());
	}// Of main
}// Of BinaryCharTree