From b5b56f06c0faa6e95925b8e63108be882e955b2f Mon Sep 17 00:00:00 2001
From: zan <zan@lyun.edu.cn>
Date: Wed, 18 Nov 2020 08:32:26 +0800
Subject: [PATCH 1/2] =?UTF-8?q?[add]=20=E5=85=88=E5=BA=8F=E9=81=8D?=
 =?UTF-8?q?=E5=8E=86=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 BinaryTree.java | 48 ++++++++++++++++++++++++++++++++++++++++++++++++
 Main.java       | 29 +++++++++++++++++++++++++++++
 Node.java       | 11 +++++++++++
 3 files changed, 88 insertions(+)
 create mode 100644 BinaryTree.java
 create mode 100644 Main.java
 create mode 100644 Node.java

diff --git a/BinaryTree.java b/BinaryTree.java
new file mode 100644
index 0000000..44fcb01
--- /dev/null
+++ b/BinaryTree.java
@@ -0,0 +1,48 @@
+// 写层序遍历用
+import java.util.Queue;
+import java.util.LinkedList;
+
+public class BinaryTree<T> {
+	public Node root;
+
+	BinaryTree(){
+		root = null;
+	}
+
+	void insert(T val){}
+
+	/*
+	*        10
+	*     5      15
+	*   3   7  12   20
+	* preOrder: 10 5 3 7 15 12 20
+	*/
+	public void preOrder(){
+		preOrderTraversal(root);
+	}
+
+	private void preOrderTraversal(Node tree){
+		if(tree != null) {
+			// root.value // 10 打印自身
+			System.out.print(tree.value);
+			System.out.print(" ");
+
+			// 打印10左子树
+			preOrderTraversal(root.left)
+			// root.left.value        // 5
+			// root.left.left.value   // 3
+			// root.left.right.value  // 7
+			
+			// 打印右子树
+			preOrderTraversal(root.right)  
+	        // root.right.value       // 15
+	        // root.right.left.value  // 12
+	        // root.right.right.value // 20
+		}
+	}
+
+
+	public void inOrder(){}
+	public void postOrder(){}
+	public void level(){}
+}
\ No newline at end of file
diff --git a/Main.java b/Main.java
new file mode 100644
index 0000000..d394f77
--- /dev/null
+++ b/Main.java
@@ -0,0 +1,29 @@
+class Main {
+	public static void main(String[] args){
+		// 构造了一个空树
+		BinaryTree<Integer> bt = new BinaryTree<Integer>();
+	/*
+	*        10
+	*     5      15
+	*   3   7  12   20
+	* preOrder: 10 5 3 7 15 12 20
+	*/		
+		bt.root = new Node<Integer>(10);
+		Node<Integer> left1 = new Node<Integer>(5);
+		bt.root.left = left1;
+		Node<Integer> right1 = new Node<Integer>(15);
+		bt.root.right = right1;
+
+		Node<Integer> left21 = new Node<Integer>(3);
+		left1.left = left21;
+		Node<Integer> left22 = new Node<Integer>(7);
+		left1.right = left22;
+
+		Node<Integer> left23 = new Node<Integer>(12);
+		Node<Integer> left24 = new Node<Integer>(20);
+		right1.left = left23;
+		right1.right = left24;
+
+		bt.preOrder();
+	}
+}
\ No newline at end of file
diff --git a/Node.java b/Node.java
new file mode 100644
index 0000000..d845786
--- /dev/null
+++ b/Node.java
@@ -0,0 +1,11 @@
+public class Node<T> {
+	public T value;
+	public Node left;
+	public Node right;
+
+	Node(T val){
+		value = val;
+		left = null;
+		right = null;
+	}
+}
\ No newline at end of file
-- 
Gitee


From 9cc1d59b78bb11bcfefa2b100f983bb939e764b0 Mon Sep 17 00:00:00 2001
From: cjh123581369 <18259247855>
Date: Sun, 22 Nov 2020 21:22:13 +0800
Subject: [PATCH 2/2] 4

---
 BinaryTree.class | Bin 0 -> 1658 bytes
 BinaryTree.java  |  79 ++++++++++++++++++++++++++++++++++++++++++-----
 Main.class       | Bin 0 -> 946 bytes
 Main.java        |  10 +++++-
 Node.class       | Bin 0 -> 438 bytes
 5 files changed, 81 insertions(+), 8 deletions(-)
 create mode 100644 BinaryTree.class
 create mode 100644 Main.class
 create mode 100644 Node.class

diff --git a/BinaryTree.class b/BinaryTree.class
new file mode 100644
index 0000000000000000000000000000000000000000..b1238ea52ce4bdf700120be447dda2979be9d42d
GIT binary patch
literal 1658
zcmaKsTT>HD5Xb+Mge+Oc00C6I9~2BB67_hz0HWgcoD+h_#B1rpLdLkVY*L#IReTk{
zfK|R}DO72d`ox2NBg@kBpJjy*z@pOAJu}_?o9<q|{CNKnz!}^%(T7|Dy*O!7oJ!y{
z{!E|;XH5Ksv+X#i*YkSkf)-=?*0>fET3j?RX(EZ77MHZRti=@rQwFXYxF!(us#RYg
zo-b6(YMjc1?b`mNKr}skkH=TJEzp^_T~%l-%qp*B%{ttP+iqQX^z2LLpIeJo&avD|
zZf5qmn)AoCXQF6VT+45G`f|Ed3O3too|^H>$`k1RrItKvQF(RCp-*}ZL;LS4`qte1
zv{efe8nzpHc7<BAW35{E!{gMt-gKeOQHzQhlEJ!u!1}Nj0_lm;*w$xEZru_vi`9lV
zr*7D~3Y}B7Yk5m0PpMH|1&O`rm)MOx5`SR8z;%fmxG8Z9e;fEm;$IvT5J$9<mzdV~
z3R(<eK;pO-!x#|g4NBVZZ70Xd&#Q9YuKN-*xGnJ??no3-VsmuQNVEYV(AC<EO<TpK
zx~~@4+-gI&ZtZ<`HFw*yUBBpi%39zIv@KdrgMm}qy}u_&u-S($H65X48W_-aD?#I9
zj(W=DHqWj+;~KTf<(A98M(2@$Vb`xO)cmDj2x-S^RfoOnO%HDcVwrpSjQ}jGt~)i8
zKemDPK57|6sBt&50+A8#5P3~YU_WINQOb72kl>&8JAi|{ul@S@i|{8luE&Ew5{H7L
z!?cd9rx^^>Br=(|h^!#G;bsPL`j}@oHI4-xb%w{ZbcW+2s~CKP*vMP7EhA1XWh|pT
zLp#AhdNsp<kpO!i;&kgL_I^I$0K*<8(;$ZU*rPm&LJTp-u^r($TH&&UJ3$zZ;dXE#
zO2_t)gbM;T!{rEf3KHiCcb;%#guB!XH?$+1Y=yf*xGBQ%^Y{&%4C^GfLh69caMuWT
zlW+x&&RxRYBiw^#xb%*2yISEM6YdG4^Ro@%UeSs%WAOu$4_DARogG<5*Zu4=x?kWj
zm(*wU6i9hubH8aORw1)`)ec<E)t_IrZEE}F&rcf<8AS(ESWG_45h(KuP@LSStWgCy
rJi}SotoJ<s`8c?PTJX4TM86|xAoCq34UBw4ill3^oMrcQjYj_ml3prC

literal 0
HcmV?d00001

diff --git a/BinaryTree.java b/BinaryTree.java
index 44fcb01..9fc3f7d 100644
--- a/BinaryTree.java
+++ b/BinaryTree.java
@@ -27,22 +27,87 @@ public class BinaryTree<T> {
 			System.out.print(tree.value);
 			System.out.print(" ");
 
-			// 打印10左子树
-			preOrderTraversal(root.left)
+
+			preOrderTraversal(tree.left);
 			// root.left.value        // 5
 			// root.left.left.value   // 3
 			// root.left.right.value  // 7
 			
-			// 打印右子树
-			preOrderTraversal(root.right)  
+
+			preOrderTraversal(tree.right);  
 	        // root.right.value       // 15
 	        // root.right.left.value  // 12
 	        // root.right.right.value // 20
 		}
+	}
+		public void inOrder(){
+		inOrderTraversal(root);
+	}
+	private void inOrderTraversal(Node tree){
+		if(tree != null) {
+
+			inOrderTraversal(tree.left);
+			// root.left.left.value        // 3
+			// root.left.value   // 5
+			// root.left.right.value  // 7
+
+			// root.value // 10 打印自身
+			System.out.print(tree.value);
+			System.out.print(" ");
+			
+			inOrderTraversal(tree.right);  
+	        // root.right.left.value       // 12
+	        // root.right.value  // 15
+	        // root.right.right.value // 20
+		}
+	}
+	public void postOrder(){
+		postOrderTraversal(root);
+	}
+	private void postOrderTraversal(Node tree){
+		if(tree != null) {
+
+
+			postOrderTraversal(tree.left);
+			// root.left.left.value        // 3
+			// root.left.right.value   // 7
+			// root.left.value  // 5
+
+
+
+			postOrderTraversal(tree.right);  
+	        // root.right.left.value       // 12
+	        // root.right.right.value  // 20
+	        // root.right.value // 15
+
+
+			// root.value // 10 打印自身
+			System.out.print(tree.value);
+			System.out.print(" ");
+	    }
+	}
+
+
+	public void level(){
+        levelTraversal(root);
 	}
 
+	private void levelTraversal(Node tree){
 
-	public void inOrder(){}
-	public void postOrder(){}
-	public void level(){}
+		LinkedList <Node> list=new LinkedList<Node>();
+		list.add(tree);
+		Node temp;
+		while(!list.isEmpty()){
+			temp=list.poll();
+			System.out.print(temp.value);
+			System.out.print(" ");
+			if(temp.left!=null){
+				list.add(temp.left);
+			}
+			if(temp.right!=null){
+				list.add(temp.right);
+			}
+		}
+		
+    }
 }
\ No newline at end of file
diff --git a/Main.class b/Main.class
new file mode 100644
index 0000000000000000000000000000000000000000..216c416fe21f032524de850be4895598c6b98b1e
GIT binary patch
literal 946
zcmY*YO-~b16g{s@``Tfk1&Ue$DTrEVOGWXEB8ny^B&C?NF(D=<Q+Sji(-|^Mo3MA~
z%7sf8E?v0M040(b-TI@9_qIbQlgxehojG&vy=UJ1{rB@1fJLn87{-{yxQ-C76FP2S
zQiq0gjF71qWz!sPGGQi$Teuy?9UU3WGBU>@%ONL`mzWobEL)D{uL$&IX5R>CFWqe=
z5HDGdDmNQ7<yFm^O^DVoEl1!==51-uY?%eybn1nQ?^#a0$S>*@x9M%ER~D0F>qMSs
zo`Df0>FEp0F}=g8r&y{?H6#iK?qY!n_YB;}qJak-9&&huq{L$bPp~8)(h@}j%Xn&F
z1xW+XI6P-vjSC4RE?U~C?WrwaVCVu`b9_}-o`7tbc2jNa@EB{eJ#z$%qQGdT2kvTh
z#?w64CDllYdncY|s~y^hJ*&P;YjodJ8{Re->FK3%c;KrBS?e~5Gul<Q+`?;e%_r}a
z*&wNrPN$b)>UEz<HVt>Fr5?wn<pd>T`|g1s<Y8O2l#Mio=&0}&qMN<}NQkltS_Q4)
zxi-XiO2`X}kq$^74p(uFa-xa_I!94@_U8<t%{KZ<*)wRH3H=n|HX_H6yp48u>)9j7
z+%cjZO1uk}8O$Fe#$cq2Eor%wcFvOl7S5%@0WDz!Sfrzr40bY~qKeUcN)j)70{sX2
zhm8{qP(Ij`$9wX`d44hGI~ot2vHEFD12Y&v4uf>e;#eie%H&y<+^UgZyJSp@`0t7N
m0V#aM7(QVfpUJ~7^xJ*KB)*Z)N0`DXrtzE91o7DM>;D0&uDq83

literal 0
HcmV?d00001

diff --git a/Main.java b/Main.java
index d394f77..133a10f 100644
--- a/Main.java
+++ b/Main.java
@@ -1,6 +1,6 @@
 class Main {
 	public static void main(String[] args){
-		// 构造了一个空树
+
 		BinaryTree<Integer> bt = new BinaryTree<Integer>();
 	/*
 	*        10
@@ -25,5 +25,13 @@ class Main {
 		right1.right = left24;
 
 		bt.preOrder();
+			System.out.println(" ");
+		bt.inOrder();
+			System.out.println(" ");
+		bt.postOrder();
+			System.out.println(" ");
+		bt.level();
+		    System.out.println(" ");
+
 	}
 }
\ No newline at end of file
diff --git a/Node.class b/Node.class
new file mode 100644
index 0000000000000000000000000000000000000000..8838035f1c4cdc56a9bef4c1c70b635d193704a9
GIT binary patch
literal 438
zcmZXQJ5Pg97>3_Nxd>ugd-FcHQB3UOq@;_96RAT<cc@3CL7EWg|8i(d9Q*<PDC2wD
zO_uk&Ki@gu&+peafID0{Ffp=W;6%x(k~0hE7A^#gO`O+Kpck&<O+3ltBAq-ZE4i#5
z1nha17I9UVY-mLhGkPvxD*-c{tzRT#qs-Dbl?bvTtEK`&uL&A2IQYl`flinea#p`5
zvW(&+XU6mhRvlgt-8W~a&6I#MU)SYQK4l7EtEb$m*Sl!r(uIWs7l&|N9Kq#gRTt>~
z{~y2PjTgA)HB8>A1)(OXHX{uVJwoUU#o1YKL5H<2qkvYU9r&LR{>>JeFSckY(LZ+G
d$J7z&AYUijCcRDVlfB>3BVq6LF<_sD;U6WAPTT+h

literal 0
HcmV?d00001

-- 
Gitee