JAVA代码二叉树的建立与遍历.docxVIP

二叉树的建立与遍历JAVA代码：package Tree;importjava.util.LinkedList;importjava.util.List;publicclassBinTreeTraverse {privateint[] array = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };privatestatic ListNode nodeList = null;privatestaticclass Node { Node leftChild; Node rightChild;intdata;Node(intnewData) {leftChild = null;rightChild = null;data = newData; } }publicvoidcreateBinTree() {nodeList = newLinkedListNode();// 将一个数组的值依次转换为Node节点for (intnodeIndex = 0; nodeIndex array.length; nodeIndex++) {nodeList.add(new Node(array[nodeIndex])); }// 对前lastParentIndex-1个父节点按照父节点与孩子节点的数字关系建立二叉树for (intparentIndex = 0; parentIndex array.length / 2 - 1; parentIndex++) {// 左孩子nodeList.get(parentIndex).leftChild = nodeList .get(parentIndex * 2 + 1);// 右孩子nodeList.get(parentIndex).rightChild = nodeList .get(parentIndex * 2 + 2); }// 最后一个父节点:因为最后一个父节点可能没有右孩子，所以单独拿出来处理intlastParentIndex = array.length / 2 - 1;// 左孩子nodeList.get(lastParentIndex).leftChild = nodeList .get(lastParentIndex * 2 + 1);// 右孩子,如果数组的长度为奇数才建立右孩子if (array.length % 2 == 1) {nodeList.get(lastParentIndex).rightChild = nodeList .get(lastParentIndex * 2 + 2); } }publicstaticvoidpreOrderTraverse(Node node) {if (node == null)return;System.out.print(node.data + );preOrderTraverse(node.leftChild);preOrderTraverse(node.rightChild); }publicstaticvoidinOrderTraverse(Node node) {if (node == null)return;inOrderTraverse(node.leftChild);System.out.print(node.data + );inOrderTraverse(node.rightChild); }publicstaticvoidpostOrderTraverse(Node node) {if (node == null)return;postOrderTraverse(node.leftChild);postOrderTraverse(node.rightChild);System.out.print(node.data + ); }publicstaticvoid main(String[] args) {BinTreeTraversebinTree = newBinTreeTraverse();binTree.createBinTree();// nodeList中第0个索引处的值即为根节点 Node root = nodeList.get(0);System.out.println(先序遍历：);preOrderTraverse(root);System.out.println();System.out.println(