Created
November 2, 2016 20:33
-
-
Save mgarod/366f542819d13f77d02ad251a34ab72f to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
* Complete the function below. | |
*/ | |
static private class TreeNode { | |
public int val; | |
public TreeNode left; | |
public TreeNode right; | |
public TreeNode(int n){ | |
this.val = n; | |
left = null; | |
right = null; | |
} | |
} | |
static private class BST { | |
TreeNode root; | |
public BST() { | |
root = null; | |
} | |
boolean empty() { | |
return root == null; | |
} | |
int insert(int k) { | |
if (root == null) { | |
root = new TreeNode(k); | |
return 0; | |
} | |
int counter = 0; | |
TreeNode n = root; | |
while (true) { | |
++counter; | |
if (k < n.val) { | |
if (n.left == null) { | |
n.left = new TreeNode(k); | |
break; | |
} else { | |
n = n.left; | |
} | |
} else { | |
if (n.right == null) { | |
n.right = new TreeNode(k); | |
break; | |
} else { | |
n = n.right; | |
} | |
} | |
} | |
return counter; | |
} | |
} | |
static void createBST(int[] keys) { | |
int counter = 0; | |
BST bst = new BST(); | |
for (int k : keys) { | |
counter += bst.insert(k); | |
System.out.println(counter); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment