Binary Search Tree Dictionary Returning All Words Misspelled
Feb 12, 2015
The assignment is to be able to read two files, a dictionary file, and a file you want to spell check. I've also attached the test files too.
When reading small files where there is only one word per line it works fine. But when I try to test a paragraph it returns all the words as misspelt.
Here are all of the classes that were given for this assignment. I've made some modifications to try to get them to work properly.
BinarySearchTree.java
// ADT binary search tree.
// Assumption: A tree contains at most one item with a given search key at any time.
public class BinarySearchTree extends BinaryTreeBasis {
// inherits isEmpty(), makeEmpty(), getRootItem(), and
// the use of the constructors from BinaryTreeBasis
[Code] .....
As you can see I read in the dictionary file and the spellcheck file, construct a new BST, and then insert each word from the dictionary into the tree.
Then I make an empty arraylist for the misspelt words. While searching through the spellcheck file, if it finds any incorrect words, it adds them to the list then returns the list after it's done reading through the file.
But for some reason it prints out every single word in the test file and I can't figure out why.
I'm trying to build a method that can search a binary search tree for a specific target and then return the number of probes it took to get there. It seems to me that the best way to do this would be a recursive search method and a counter that tracks the number of calls. But I'm struggling with how to implement this. Here's the code I have so far. what works/doesn't work with the method.
// Method to search the tree for a specific name and // return the number of probes public T search(BTNode<T> btNode) {
The problem is it is returning -2, and also returning false when it should be true. There is no error it just is not working correctly.
import java.util.Arrays; import java.util.Scanner; /** * This Script will allow you to add e-Mails and than beable to search for them. */ public class eMailSeacher { public static void main(String[] args)
[Code] ....
1. Enter an Email 2. Find an existing email 3. Exit 1 Enter the users E-Mail: josh -1 Insertion successful.
I am trying to implement a simple binary search tree . How can I make a node in the tree which should store two pieces of information: a String variable called name, and a int variable called mark. ..
public class BinarySearchTree<E> implements Comparable<E> { public BinaryTree<E> root; int size; int mark; String name; // Constructor public BinarySearchTree()
I don't see any nodes that I add. Not sure why getting this error.
duplicate found Exception in thread "main" java.lang.NullPointerException at binarysearchtree.delete(binarysearchtree.java:111) at binarysearchtree.main(binarysearchtree.java:196) Java Result: 1 public class node<T>
I'm trying to implement a Binary Search Tree that accepts strings. I cannot figure out how to compare the string value in my add method against the node object. While I could make the node class data be the string type I am trying to make the code be as reusable as possible. So my question is this, is there a simple way I can compare the two that I am missing?
public class BTNode<E> { private E data; private BTNode<E> left, right; //constructor public BTNode(E initialData, BTNode<E> initialLeft, BTNode<E> initialRight) { data = initialData; left = initialLeft; right = initialRight;
I am trying to make binary search tree...I am trying to construct the left part of binary search tree with root node set as 70...It is not working ...My code is
public class Node { /** * @param args */
int root; Node left; Node right; public void insertNode(Node node, int num) { //Node nodeRoot = this; //root of tree we have set to 70...constructing only left of tree with root=70
I am trying to draw a binary node tree to a text file.
public class BinaryTreeExample { public static void main(String[] args) { new BinaryTreeExample().run(); } static class Node { Node left; Node right; int value; public Node(int value) {
[Code] .....
This will output:
Building tree with rootvalue25 ================================= Inserted 11 to left of node 25 Inserted 15to right of node 11 Inserted 16to right of node 15 Inserted 23to right of node 16 Inserted 79to right of node 25 Traversing tree in order ================================= Traversed 11 Traversed 15 Traversed 16 Traversed 23 Traversed 25 Traversed 79
I need to print this information in the form of a graphic to a text file. so for example:
The purpose of this function is to use a Movie object and a binary search tree to find all movies that have been read in through a file that have a certain rating (G,PG,PG-13,R). The error I am getting is that it seems I am not traversing fully through the tree and therefore only some movies with the rating I search for are output, not all of them with that rating. I have tried figuring out why this is happening and at first I thought my tree was unbalanced, but I am sure it is simply because I am not traversing the tree correctly. I think my implementation in the main is close to what I need but it needs some tweaking. This is my BST class which I created and required to use for this purpose.
public class BinarySearchTree { /** * The head of the tree. */ private Node root; /** * Constructor that declares the head of tree to null. */ public BinarySearchTree() { root = null; } /** * Returns null if head of tree is empty. * @return null if head of tree is empty. */ public boolean isEmpty(){
So in my binary search tree I'm trying to write a method that deletes the idem but for some reason it's not working. I have two things, I have the method and then another piece of code that tests the deletion method. Here's the actual method
i wrote it on paper with my examples.and just for laughts , i uploaded another picture that dont belong to my problem. its just my way to understand binary search tree implementation , so i wanted so share.just for laught : looks like the map of the universe.
now my problem : why after i changed Current to Current.left, Parent still has the value of root. i draw and wrote it on a paper. to be clear as possible - picture 2 :
I Write a Java program to parse a syntactically correct arithmetical expression and produce an equivalent Expression TREE. Remember, in an expression tree the terminal nodes are variables and constants, and the interior nodes are operators (such as +,-,*,/).
For instance the expression: (1 + 2) * 3 can be represented by the following tree:
But when i Execute the program it Shows only Prefix and postfix .But the requered output is in inorder preorder and postorder so how to solve these error
import java.io.BufferedReader; import java.io.FileReader; import java.io.IOException; import java.util.Scanner; import javax.swing.tree.TreeNode; public class InToPost { private static String str;
I'm trying to use LinkedBinarySearchTree but a lot of the variables are protected in BinaryTreeNode. I am creating a BinaryTreeNode object but it still isn't allowing me to use them. The variables I am trying to use are element, left, and right.
import ch11.exceptions.*; import ch10.LinkedBinaryTree; import ch10.BinaryTreeNode; /** * LinkedBinarySearchTree implements the BinarySearchTreeADT interface with links.
*/ public class LinkedBinarySearchTree<T> extends LinkedBinaryTree<T> implements BinarySearchTreeADT<T>
-getting words from dictionary text file and inserting them into a hash table - DONE -getting words from a usertext file and inserting them into a red-black tree - STUCK -after that i need to see if there is nodes of words that dosen't exist in the dictionary and print if so
kinda like a spelling checker
OK so the main code that hold the reading and storing part of dictionary and inserting to hash table
I have to create a dictionary in java using search trees. I have problems with the methods put() and remove(). Working properly, ie correctly adds a new element and eliminates correctly. But I should improve a few things.
As you can see from the interface, both methods must return an element of type V, that is:
- case put(): returns the previous value associated with key (or null if the key was not associated with any value) - case remove(): returns the value associated with the key (or null if the key was not present in the dictionary)
I do not understand how come my put method always returns null even though in reality I make him return node.getElement().
Instead, the remove() method does not know how to modify it to make sure it returns the value associated with the key. If I change the helper method return value in V (instead of Node<K, V>) method does not work anymore...
How can I then edit these two methods?
Class SearchTree: public class SearchTree<K extends Comparable, V> implements Dictionary<K, V> { public int size; public Node<K, V> root; public SearchTree() { root = null; size = 0;
The question pretty much says it all, but I tasked myself with creating a program about lemurs. There are multiple class files in this program. In the below code snippet, I have my TreeLemur.class which extends to the Lemur.class which extends to the Mammal.class. However, when I create a Tree Lemur object in the main program, it is returning null consistently from certain methods. What am I doing wrong here?
TreeLemur.class :
public class TreeLemur extends Lemur { private String groupSize; private String diet; private String fur; public void setGroupSize() { groupSize = " Group Size: Large"; }
[Code]...
As of yet, I'm just trying to get Tree Lemur working properly to continue with creating the other if-branches within the main program.
So everything in my program is working EXCEPT when it comes to calculating the result. I am supposed to evaluate the expression using postorder traversal to return the answer. I am honestly not sure how I would get the postorder traversal to return the answer to the expression since the only thing we really went over was how it re-ordered the expression so that it would end in the postorder/postfix order. Anyways, currently the way that I have the public int evaluate(Node node)method set up is giving me a result of 0, which obviously is not correct.
Here's the section that I'm having issues with:
public int evaluate(Node node){ if(node.isLeaf()){ return Integer.parseInt(node.value); } int result = 0; int left = evaluate(node.left); int right = evaluate(node.right);
I have a list of people with a matching telephone extension number, the people are organised in a hierachy tree with some colleagues at the same level and then some junior colleagues. I have been trying to write code that can find the tree height of any given member but I am unable too. Here is my code so far but the left and right are not working because I have not declared them any where in my code.
Java Code:
//hierarchy rank section 7 // **Depth** from node to root (bottom up) public int rank(Member p1){ //to do
We have this piece of code and we must make a search for a key. if the key exist it returns true if not false. Plus we must insert a key in the class. If it is already in there we say hey its already in and we don t put it again...
package askisi2; import java.util.*; public class mtree { protected class tnode { public int k1; public int k2; public int k3;
I know that for a binary search tree the insert() method is easy. You just kept comparing the values of the nodes, and you would know whether to go left or right depending on the value of the node.However, I am stumped when trying to figure out how to add a node into a normal binary tree where you just keep adding the nodes to the leftmost side, regardless of value.Here is my attempt at the insert() method:
public class RegularTree extends BinaryTree { public CompleteTree() { super(); }
public void insert(Comparable item) { if(this.isEmpty()) { this.setRoot(new TreeNode(item)); return;
Is there a way that I can view my entire binary tree on Eclipse? I remember the old IDE that I used, jGrasp, had a feature in its debugging that would allow me to see exactly what was going on and I want to know if Eclipse has the same thing.
