Search:

Type: Posts; User: bagalakadaka

Search: Search took 0.11 seconds.

  1. Replies
    9
    Views
    1,434

    Re: binarysearchtree traversing

    if I cast node1 as <E> will it make a difference?
  2. Replies
    9
    Views
    1,434

    Re: binarysearchtree traversing

    ok so this is what i have so far. does it make sense??


    Node node1 = root;
    boolean result = false;

    if(root == someElement)
    return true;
    //go through left
    if(node1.left != null){
  3. Replies
    9
    Views
    1,434

    Re: binarysearchtree traversing

    I'm pretty sure it's contained in a node.
  4. Replies
    9
    Views
    1,434

    Re: binarysearchtree traversing

    done! thanks
  5. Replies
    9
    Views
    1,434

    binarysearchtree traversing

    Hi, I'm trying to figure out how to do this contains method. everything that's in the method is my code. My thinking is: start at root and go in Inorder traversal and use .equals(). Should I even do...
Results 1 to 5 of 5