? 樹存儲方式能提高數(shù)據(jù)存儲,讀取的效率.

?

二叉樹:?

?

?

二叉樹的遍歷

? 前序遍歷: 先輸出父節(jié)點,再遍歷左子樹和右子樹。

? 中序遍歷:?先遍歷左子樹,再輸出父節(jié)點, 再遍歷右子樹。

? 后序遍歷: 先遍歷左子樹,再遍歷右子樹, 最后輸出父節(jié)點。

public class BinaryTreeDemo {public static void main(String[] args) {// 先創(chuàng)建一棵二叉樹BinaryTree binaryTree = new BinaryTree();// 創(chuàng)建需要的結(jié)點HeroNode root = new HeroNode(1, "宋江");HeroNode node2 = new HeroNode(2, "吳用");HeroNode node3 = new HeroNode(3, "盧俊義");HeroNode node4 = new HeroNode(4, "林沖");HeroNode node5 = new HeroNode(5, "關(guān)勝");binaryTree.setRoot(root);root.setLeft(node2);root.setRight(node3);node3.setRight(node4);node3.setLeft(node5);// 前序遍歷System.out.println("前序遍歷");binaryTree.preOrder();binaryTree.delNode(3);System.out.println("刪除后:");binaryTree.preOrder();//HeroNode nodeT = binaryTree.preOrderSearch(5);//System.out.println(nodeT);//BinaryTree.printCount();HeroNode.count = 0;// 中序遍歷//System.out.println("中序遍歷");//binaryTree.infixOrder();//nodeT = binaryTree.infixOrderSearch(5);//System.out.println(nodeT);//BinaryTree.printCount();HeroNode.count = 0;// 后序遍歷//System.out.println("后序遍歷");//binaryTree.postOrder(); // nodeT = binaryTree.postOrderSearch(5); // System.out.println(nodeT); // BinaryTree.printCount();} }class BinaryTree{private HeroNode root;public void setRoot(HeroNode root) {this.root = root;}public void delNode(int no){if(this.root == null){System.out.println("二叉樹為空");}else if(this.root != null && this.root.getNo() == no){this.root = null;}else{this.root.delNode(no);}}// 前序遍歷public void preOrder(){if(this.root != null){this.root.preOrder();}else{System.out.println("二叉樹為空,無法遍歷");}}// 中序遍歷public void infixOrder(){if(this.root != null){this.root.infixOrder();}else{System.out.println("二叉樹為空,無法遍歷");}}// 后序遍歷public void postOrder(){if(this.root != null){this.root.postOrder();}else{System.out.println("二叉樹為空,無法遍歷");}}// 前序遍歷查找public HeroNode preOrderSearch(int no){if(this.root != null){return this.root.preOrderSearch(no);}else{System.out.println("二叉樹為空,無法遍歷");return null;}}// 中序遍歷查找public HeroNode infixOrderSearch(int no){if(this.root != null){return this.root.infixOrderSearch(no);}else{System.out.println("二叉樹為空,無法遍歷");return null;}}// 后序遍歷查找public HeroNode postOrderSearch(int no){if(this.root != null){return this.root.postOrderSearch(no);}else{System.out.println("二叉樹為空,無法遍歷");return null;}}public static void printCount(){HeroNode.printCount();} }class HeroNode{public static int count = 0;private int no;private String name;private HeroNode left; // 默認(rèn)為nullprivate HeroNode right; // 默認(rèn)為nullpublic HeroNode(int no, String name) {this.no = no;this.name = name;}public int getNo() {return no;}public void setNo(int no) {this.no = no;}public String getName() {return name;}public void setName(String name) {this.name = name;}public HeroNode getLeft() {return left;}public void setLeft(HeroNode left) {this.left = left;}public HeroNode getRight() {return right;}public void setRight(HeroNode right) {this.right = right;}@Overridepublic String toString() {return "HeroNode{" +"no=" + no +", name='" + name + '\'' +'}';}// 遞歸刪除結(jié)點public void delNode(int no){if(this.left != null){if(this.left.no == no){this.left = null;return;}else{this.left.delNode(no);}}if(this.right != null){if(this.right.no == no){this.right = null;return;}else{this.right.delNode(no);}}}// 前序遍歷public void preOrder(){System.out.println(this); // 先輸出父結(jié)點// 遞歸左子樹if(null != this.left){this.left.preOrder();}// 遞歸右子樹if(null != this.right){this.right.preOrder();}}// 中序遍歷public void infixOrder(){// 先遞歸左子樹if(null != this.left){this.left.infixOrder();}System.out.println(this); // 輸出父結(jié)點// 最后遞歸右子樹if(null != this.right){this.right.infixOrder();}}// 后序遍歷public void postOrder(){// 先遞歸左子樹if(null != this.left){this.left.postOrder();}// 再遞歸右子樹if(null != this.right){this.right.postOrder();}System.out.println(this); // 最后輸出父結(jié)點}// 前序遍歷查找public HeroNode preOrderSearch(int no){count++;HeroNode node = null;if(this.no == no){return this;}if(this.left != null){node = this.left.preOrderSearch(no);}if(null != node){return node;}if(this.right != null){node = this.right.preOrderSearch(no);}return node;}// 中序遍歷查找public HeroNode infixOrderSearch(int no){HeroNode node = null;if(this.left != null){node = this.left.infixOrderSearch(no);}if(null != node){return node;}count++;if(this.no == no){return this;}if(this.right != null){node = this.right.infixOrderSearch(no);}return node;}// 后序遍歷查找public HeroNode postOrderSearch(int no){HeroNode node = null;if(this.left != null){node = this.left.postOrderSearch(no);}if(null != node){return node;}if(this.right != null){node = this.right.postOrderSearch(no);}if(null != node){return node;}count++;if(this.no == no){return this;}return node;}public static void printCount(){System.out.printf("遍歷了%d次\n",count);} }

?

總結(jié)

以上是生活随笔為你收集整理的数据结构: 树的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。