BinarySearchTree(The ikook implementation)

ikook-wang · ikook-wang · commit 4093dcc3e639 · 2017-02-24T22:24:20.000+08:00
diff --git a/group18/935542673/Coding/src/com/ikook/basic_data_structure/MyBinarySearchTree.java b/group18/935542673/Coding/src/com/ikook/basic_data_structure/MyBinarySearchTree.java
@@ -139,7 +139,7 @@ else if (current.left != null && current.right != null) {
 	 * @param deleleNode
 	 * @return
 	 */
-	public Node getSuccessor(Node deleleNode) {
+	private Node getSuccessor(Node deleleNode) {
 		Node successsor = null;
 		Node successsorParent = null;
 		Node current = deleleNode.right;
@@ -162,7 +162,7 @@ public Node getSuccessor(Node deleleNode) {
 	 * @param root
 	 * @param sb
 	 */
-	public void display(Node root, StringBuilder sb) {
+	private void display(Node root, StringBuilder sb) {
 		if (root != null) {
 			display(root.left, sb);
 			sb.append(root.data + " ");
