二叉树定义:
/**
* Author: Heynchy
* Date: 2019/6/24
* <p>
* Introduce: 二叉树的定义
*/
public class TreeNode implements Serializable {
private TreeNode left; // 左子树
private TreeNode right; // 右子树
private String value; // 值
public TreeNode(String value){
this.value = value;
}
public TreeNode getLeft() {
return left;
}
public void setLeft(TreeNode left) {
this.left = left;
}
public TreeNode getRight() {
return right;
}
public void setRight(TreeNode right) {
this.right = right;
}
public String getValue() {
return value;
}
public void setValue(String value) {
this.value = value;
}
}
二叉树初始化:
/**
* --------------二叉树初始化--------
* <p>
* 1
* / \
* 2 3
* / \ / \
* 4 5 6 7
*/
private void initTreeNodes() {
mRoot = new TreeNode("1");
TreeNode secondNode = new TreeNode("2");
TreeNode thirdNode = new TreeNode("3");
TreeNode forthNode = new TreeNode("4");
TreeNode fifthNode = new TreeNode("5");
TreeNode sixNode = new TreeNode("6");
TreeNode sevenNode = new TreeNode("7");
mRoot.setLeft(secondNode);
mRoot.setRight(thirdNode);
secondNode.setLeft(forthNode);
secondNode.setRight(fifthNode);
thirdNode.setLeft(sixNode);
thirdNode.setRight(sevenNode);
}
二叉树前序遍历(DLR):
/**
* 前序遍历
* 1 2 4 5 3 6 7
* 先访问根节点, 再遍历左子树, 最后遍历右子树
*
* @param treeNode
*/
private void printDLR(TreeNode treeNode) {
if (treeNode != null) {
Log.i("HEYN1234", "前序遍历 = " + treeNode.getValue());
printDLR(treeNode.getLeft());
printDLR(treeNode.getRight());
}
}
二叉树中序遍历(LDR):
/**
* 中序遍历
* 4 2 5 1 6 3 7
* 先遍历左子树,再访问根节点, 最后遍历右子树
*
* @param treeNode
*/
private void printLDR(TreeNode treeNode) {
if (treeNode != null) {
printLDR(treeNode.getLeft());
Log.i("HEYN1234", "中序遍历 = " + treeNode.getValue());
printLDR(treeNode.getRight());
}
}
二叉树后续遍历(LRD):
/**
* 后序遍历
* 4 5 2 6 7 3 1
* 先遍历左子树, 然后遍历右子树, 最后访问根节点,
*
* @param treeNode
*/
private void printLRD(TreeNode treeNode) {
if (treeNode != null) {
printLRD(treeNode.getLeft());
printLRD(treeNode.getRight());
Log.i("HEYN1234", "后序遍历 = " + treeNode.getValue());
}
}