日撸Java三百行 day21(二叉树的深度遍历的递归实现)

1. 二叉树

1.1 二叉树的定义

二叉树是n(n>=0)个结点的有限集合，该集合或为空集，或由一个根结点和两棵互不相交的、分别称为根结点的左子树和右子树组成。二叉树中的节点的度最大为2，且有左右孩子的区分。

二叉树的代码定义:

char value;

BinaryCharTree leftChild;
BinaryCharTree rightChild;

public BinaryCharTree(char paraName) {
	value = paraName;
	leftChild = null;
	rightChild = null;
}// Of the constructor

1.2 实际二叉树的建立

在建立一个实际的二叉树时，一定要注意根结点的定义和链接时的左右孩子的区分。

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 al nodes.
	resultTree.leftChild = tempTreeB;
	resultTree.rightChild = tempTreeC;
	tempTreeB.rightChild = tempTreeD;
	tempTreeC.leftChild = tempTreeE;
	tempTreeD.leftChild = tempTreeF;
	tempTreeD.rightChild = tempTreeG;

	return resultTree;
}// Of manualConstructTree

1.3 二叉树的遍历

这里遍历都是使用的递归方法，只用变换拜访节点位置就可实现前中后序遍历。

先序根左右，中序左右根，后序左右根。

public void Visit() {
    // Pre-Oreder visit.
	// System.out.print("" + value + " ");

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

    // In-Oreder visit.
	// System.out.print("" + value + " ");

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

    // Post-Oreder visit.
	// System.out.print("" + value + " ");
}// Of preOrderVisit

 1.4 二叉树的深度与节点数

二叉树的深度和节点数的求解都是基于递归的先序遍历的使用。

2.总代码

package datastructure.tree;

import java.util.Arrays;

/**
 * Binary tree with char type elements.
 * 
 * @author Yunhua Hu yunhuahu0528@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

	/**
	 *********************
	 * Manually construct a tree. Only for testing.
	 *********************
	 */
	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 al nodes.
		resultTree.leftChild = tempTreeB;
		resultTree.rightChild = tempTreeC;
		tempTreeB.rightChild = tempTreeD;
		tempTreeC.leftChild = 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 if
	}// Of preOrderVisit

	/**
	 *********************
	 * In-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();
		} // Of if

		System.out.print("" + value + " ");
	}// Of postOrderVisit

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

		int tempLeftDepth = 0;
		if (leftChild != null) {
			tempLeftDepth = leftChild.getDepth();
		} // Of if

		int tempRightDepth = 0;
		if (rightChild != null) {
			tempRightDepth = rightChild.getDepth();
		} // Of if

		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 the 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\nPre-order 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\nThe depth is: " + tempTree.getDepth());
		System.out.println("The number of the nodes is: " + tempTree.getNumNodes());
	}// Of main

}// Of BinaryCharTree

输出:

 

问题:遍历时的输出为什么前面要加个""，是因为print的输出格式是这样的吗?