以下代码显示了二叉树(带有键和值)的插入方法的实现,该方法允许重复多个键。
private TreeNode insert (int key, String data, TreeNode subtree) {
// TODO: implement
// Use random.nextBoolean to decide whether to go right or left
// when key is equal to subtree.key
if(key == subtree.key) {
}
if(subtree == null) {
}
boolean a = random.nextBoolean();
return null;
}
因为前面的陈述必须当NullPointerException
为subtree
时抛出null
。在这里,
if(key == subtree.key) {
测试该first。喜欢,
if(subtree == null) {
}
if(key == subtree.key) {
}