我正在尝试实现在 Java 中创建二叉搜索树的方法,最终将能够创建单词引用报告。
我的问题是我无法正确编译我的 insertItem
方法。
行 else if(word.compareTo(r.item)){
给出了一个指向 r.item
的编译器错误,并表示它无法转换为字符串。我应该怎么做才能解决这个问题?
public void insert(String word) {
root = insertItem(root, word);
}
protected TreeNode insertItem(TreeNode r, String word) {
//base case
if (r==null) {
new TreeNode(new WordRefs(word));
}
else if (word.compareTo(r.item)) {
r.left = insertItem(r.left, word);
} else {
r.right = insertItem(r.right, word);
}
return r;
}
public class WordRefs {
private String word;
private LinkedList<Integer> lineNumbers;
public WordRefs(String word) {
this.word = word;
lineNumbers = new LinkedList<>();
}
public void addLine(int lineNumber) {
lineNumbers.add(lineNumber);
}
public String getWord() {
return word;
}
public LinkedList<Integer> getLineNumbers() {
return lineNumbers;
}
public String toString() {
String result = word + ":";
for (Integer ii : lineNumbers) {
result += " " + ii;
}
return result;
}
}
class TreeNode {
WordRefs item;
TreeNode left;
TreeNode right;
public TreeNode(WordRefs item) {
this.item = item;
this.left = this.right = null;
}
public TreeNode(WordRefs item, TreeNode left, TreeNode right) {
this.item = item;
this.left = left;
this.right = right;
}
}
最佳答案
您的插入函数应该是这样的,您必须使用 WordReft 中的 getWord() 函数,并且它应该 <= 0 转到左侧, > 0 转到右侧
protected TreeNode insertItem(TreeNode r, String word) {
//base case
if(r==null){
r = new TreeNode(new WordRefs(word));
}
else if(word.compareTo(r.item.getWord()) <= 0){
r.left = insertItem(r.left, word);
}else{
r.right = insertItem(r.right, word);
}
return r;
}
关于java - 编写二叉搜索树的插入方法,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/29403319/