[英]How to implement keySet method in Binary Search Tree
import tree.BinaryTree;
public class TreeMap<K extends Comparable<K>, V> implements MyMap<K, V> {
private BinaryTree<Element> map;
java.util.Set<K> keys;
private int size;
@Override
public java.util.Set<K> keySet() {
inorder(map);
return keys;
}
public String toString() {
return map.toString();
}
private class Element {
K key;
V value;
public Element(K key, V value) {
this.key = key;
this.value = value;
}
public int compareTo(Element that) {
return this.key.compareTo(that.key);
}
public String toString() {
return (key.toString());
}
}
private void inorder(BinaryTree<Element> tree) {
if (tree != null) {
inorder(tree.getLeft());
keys.add(tree.getRoot().key);
inorder(tree.getRight());
}
}
}
大家好! :)在按我的鍵集添加鍵時遇到很多麻煩。 如何將密鑰附加到集合? :/最糟糕的部分是它沒有向我顯示所有異常
at TreeMap.inorder(TreeMap.java:188)
at TreeMap.keySet(MyTreeMap.java:60)
at TreeMap.main(MyTreeMap.java:244)
Java Result: 1
這只是我的代碼的一部分,除了我的keySet / inorder方法之外,其他所有方法都可以使用。 我的代碼上的188行是
keys.add(tree.getRoot().key);
我已經搜索,重試並再次搜索,但無法到達任何地方。 謝謝您能給我的任何幫助。 提前致謝! :)
這是BinaryTree類
public class BinaryTree<E>
{
private E root;
private BinaryTree<E> left;
private BinaryTree<E> right;
public BinaryTree(E paramE, BinaryTree<E> paramBinaryTree1, BinaryTree<E> paramBinaryTree2)
{
this.root = paramE;
this.left = paramBinaryTree1;
this.right = paramBinaryTree2;
}
public BinaryTree(E paramE)
{
this(paramE, null, null);
}
public E getRoot()
{
return (E)this.root;
}
public BinaryTree<E> getLeft()
{
return this.left;
}
public BinaryTree<E> getRight()
{
return this.right;
}
public E setRoot(E paramE)
{
Object localObject = this.root;
this.root = paramE;
return (E)localObject;
}
public BinaryTree<E> setLeft(BinaryTree<E> paramBinaryTree)
{
BinaryTree localBinaryTree = this.left;
this.left = paramBinaryTree;
return localBinaryTree;
}
public BinaryTree<E> setRight(BinaryTree<E> paramBinaryTree)
{
BinaryTree localBinaryTree = this.right;
this.right = paramBinaryTree;
return localBinaryTree;
}
public String toString()
{
StringBuilder localStringBuilder = new StringBuilder("" + this.root);
if (!isLeaf())
{
localStringBuilder.append("(");
if (this.left != null) {
localStringBuilder.append(this.left);
}
if (this.right != null) {
localStringBuilder.append("," + this.right);
}
localStringBuilder.append(")");
}
return localStringBuilder + "";
}
public boolean isLeaf()
{
return (this.left == null) && (this.right == null);
}
}
根據您的代碼,TreeSet從未初始化
TreeSet ts = new TreeSet();
我認為應該修復它...
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.