一、二叉树的遍历
1,深度优先遍历:(1)先序遍历,根左右 ABDHICFG
(2)中序遍历,左根右 HDIBAFCG
(3)后序遍历,左右根 HIDBFGCA
代码实现:
//前序
public void rescursion1(TreeNode) {
if(Node != null) {
System.out.println(Node.value);
rescursion1(Node.leftChild);
rescursion1(Node.rightChild);
}
}
//中序
public void rescursion2(TreeNode) {
if(Node != null) {
rescursion1(Node.leftChild);
System.out.println(Node.value);
rescursion1(Node.rightChild);
}
}
//后序
public void rescursion3(TreeNode) {
if(Node != null) {
rescursion1(Node.leftChild);
rescursion1(Node.rightChild);
System.out.println(Node.value);
}
}