二叉树的遍历
遍历:按照某一种次序依次访问各个结点,每个结点恰好访问一次。
二叉树前序遍历
1.递归实现前序遍历
<pre>
public static void main(String[] args) {
//设置结点之间的关系
BinNode root = new BinNode(0);
BinNode node1 = new BinNode(1);
BinNode node2 = new BinNode(2);
root.left = node1; root.right = node2;
node1.parent = root; node2.parent = root;
BinNode node3 = new BinNode(3);
BinNode node4 = new BinNode(4);
node1.left = node3; node1.right = node4;
node3.parent = node1; node4.parent = node1;
BinNode node5 = new BinNode(5);
BinNode node6 = new BinNode(6);
node2.left = node5; node2.right = node6;
node5.parent = node2; node6.parent = node2;
BinNode node7 = new BinNode(7);
BinNode node8 = new BinNode(8);
node3.left = node7; node3.right = node8;
node7.parent = node3; node8.parent = node3;
preorder(new BinTree(root));
}
</pre>
<pre>