binary insert success

Author: 1367356

.metadata/.plugins/org.eclipse.core.resources/.history/83/9081113f889f00171fc5dda2158bf345

@@ -0,0 +1,22 @@
+package binarytree;
+
+import binarytree.BinaryTree.Node;
+
+public class TestClass {
+				public static void main(String[] args) {
+					BinaryTree<Integer> bt=new BinaryTree<>();
+					bt.insert(5);
+					bt.insert(9);
+					bt.insert(6);
+					bt.insert(3);
+					bt.insert(5);
+					bt.insert(9);
+					bt.insert(6);
+					bt.insert(2);
+
+					
+
+					Node node=bt.root;
+					bt.print(node);
+				}
+}

.metadata/.plugins/org.eclipse.core.resources/.history/9f/b044c5b18d9f00171fc5dda2158bf345

@@ -0,0 +1,53 @@
+package binarytree;
+
+public class BinaryTree<T extends Comparable<T>> {
+	Node<T> root = null;
+
+	public class Node<T extends Comparable<T>> {
+		Node leftChild;
+		Node rightChild;
+		Node parent;
+		T key;
+	}
+
+	public void print(Node node) {
+		System.out.println(node.leftChild.key);
+	}
+	
+	public void delete(T key){
+		Node newNode=new Node();
+		newNode.key=key;
+		Node tem=root;
+		
+		while(key!=tem.key){
+			
+		}
+	}
+
+	public void insert(T key) { // 向二叉树中插入
+		Node newNode = new Node();
+		newNode.key = key;
+		Node tem = root;
+		Node p = null;
+		while (tem != null) {
+			p = tem;
+			if (newNode.key.compareTo(tem.key) < 0) {
+				tem = tem.leftChild;
+			} else {
+				tem = tem.rightChild;
+			}
+		}
+		newNode.parent = p;
+
+		if (p == null) {                           //二叉树为空时。
+			root = newNode;
+
+		} else if ((newNode.key).compareTo(p.key) < 0) {
+
+			p.leftChild = newNode;
+		} else {
+			p.rightChild = newNode;
+		}
+	}
+
+}

.metadata/.plugins/org.eclipse.core.resources/.history/d1/40f8002f8c9f00171fc5dda2158bf345

@@ -0,0 +1,43 @@
+package binarytree;
+
+public class BinaryTree<T extends Comparable<T>> {
+	Node<T> root = null;
+
+	public class Node<T extends Comparable<T>> {
+		Node leftChild;
+		Node rightChild;
+		Node parent;
+		T key;
+	}
+
+	public void print(Node node) {
+		System.out.println(node.leftChild.key);
+	}
+
+	public void insert(T key) { // 向二叉树中插入
+		Node newNode = new Node();
+		newNode.key = key;
+		Node tem = root;
+		Node p = null;
+		while (tem != null) {
+			p = tem;
+			if (newNode.key.compareTo(tem.key) < 0) {
+				tem = tem.leftChild;
+			} else {
+				tem = tem.rightChild;
+			}
+		}
+		newNode.parent = p;
+
+		if (p == null) {                           //二叉树为空时。
+			root = newNode;
+
+		} else if ((newNode.key).compareTo(p.key) < 0) {
+
+			p.leftChild = newNode;
+		} else {
+			p.rightChild = newNode;
+		}
+	}
+
+}

.metadata/.plugins/org.eclipse.core.resources/.history/d4/10196f518d9f00171fc5dda2158bf345

@@ -0,0 +1,47 @@
+package binarytree;
+
+public class BinaryTree<T extends Comparable<T>> {
+	Node<T> root = null;
+
+	public class Node<T extends Comparable<T>> {
+		Node leftChild;
+		Node rightChild;
+		Node parent;
+		T key;
+	}
+
+	public void print(Node node) {
+		System.out.println(node.leftChild.key);
+	}
+	
+	public void delete(T key){
+		
+	}
+
+	public void insert(T key) { // 向二叉树中插入
+		Node newNode = new Node();
+		newNode.key = key;
+		Node tem = root;
+		Node p = null;
+		while (tem != null) {
+			p = tem;
+			if (newNode.key.compareTo(tem.key) < 0) {
+				tem = tem.leftChild;
+			} else {
+				tem = tem.rightChild;
+			}
+		}
+		newNode.parent = p;
+
+		if (p == null) {                           //二叉树为空时。
+			root = newNode;
+
+		} else if ((newNode.key).compareTo(p.key) < 0) {
+
+			p.leftChild = newNode;
+		} else {
+			p.rightChild = newNode;
+		}
+	}
+
+}

.metadata/.plugins/org.eclipse.core.resources/.history/ef/f062a51c8f9f00171fc5dda2158bf345

@@ -0,0 +1,58 @@
+package binarytree;
+
+public class BinaryTree<T extends Comparable<T>> {
+	Node<T> root = null;
+
+	public class Node<T extends Comparable<T>> {
+		Node leftChild;
+		Node rightChild;
+		Node parent;
+		T key;
+	}
+
+	public void print(Node node) {
+		System.out.println(node.leftChild.key);
+	}
+	
+	public void delete(T key){
+		Node newNode=new Node();
+		newNode.key=key;
+		Node tem=root;
+		
+		while(newNode.key!=tem.key){
+			if (newNode.key.compareTo(tem.key) < 0) {
+				tem = tem.leftChild;
+			} else {
+				tem = tem.rightChild;
+			}
+		}
+		//tem是最后和给定值相等的节点。
+	}
+
+	public void insert(T key) { // 向二叉树中插入
+		Node newNode = new Node();
+		newNode.key = key;
+		Node tem = root;
+		Node p = null;
+		while (tem != null) {
+			p = tem;
+			if (newNode.key.compareTo(tem.key) < 0) {
+				tem = tem.leftChild;
+			} else {
+				tem = tem.rightChild;
+			}
+		}
+		newNode.parent = p;
+
+		if (p == null) {                           //二叉树为空时。
+			root = newNode;
+
+		} else if ((newNode.key).compareTo(p.key) < 0) {
+
+			p.leftChild = newNode;
+		} else {
+			p.rightChild = newNode;
+		}
+	}
+
+}

.metadata/.plugins/org.eclipse.core.resources/.history/f0/503f70df8d9f00171fc5dda2158bf345

@@ -0,0 +1,57 @@
+package binarytree;
+
+public class BinaryTree<T extends Comparable<T>> {
+	Node<T> root = null;
+
+	public class Node<T extends Comparable<T>> {
+		Node leftChild;
+		Node rightChild;
+		Node parent;
+		T key;
+	}
+
+	public void print(Node node) {
+		System.out.println(node.leftChild.key);
+	}
+	
+	public void delete(T key){
+		Node newNode=new Node();
+		newNode.key=key;
+		Node tem=root;
+		
+		while(newNode.key!=tem.key){
+			if (newNode.key.compareTo(tem.key) < 0) {
+				tem = tem.leftChild;
+			} else {
+				tem = tem.rightChild;
+			}
+		}
+	}
+
+	public void insert(T key) { // 向二叉树中插入
+		Node newNode = new Node();
+		newNode.key = key;
+		Node tem = root;
+		Node p = null;
+		while (tem != null) {
+			p = tem;
+			if (newNode.key.compareTo(tem.key) < 0) {
+				tem = tem.leftChild;
+			} else {
+				tem = tem.rightChild;
+			}
+		}
+		newNode.parent = p;
+
+		if (p == null) {                           //二叉树为空时。
+			root = newNode;
+
+		} else if ((newNode.key).compareTo(p.key) < 0) {
+
+			p.leftChild = newNode;
+		} else {
+			p.rightChild = newNode;
+		}
+	}
+
+}