Thread: Finding deepest node of tree??

hi.. i have a binary search tree class which is a user defined one.. when i invoke the deepNode method some sort of logic error occur...

the tree structure is :


Uploaded with ImageShack.us
the code of the deepNode is:

  public void deepNode()
    {
            if (isEmpty())return;
 
            Queue2 q= new Queue2();
 
            q.enqueue(root);
 
            while (!q.isEmpty())
            {
                BTNode cur=(BTNode) (q.dequeue());
 
                if (cur!=null)
                {
                    if (cur.left!=null)
                        q.enqueue(cur.left);
                    if (cur.right!=null)
                        q.enqueue(cur.right);
                    if (cur.right==null && cur.left==null)
                        System.out.println(cur.item);
                }
            }
        }

the current output is: 23, 21

the correct output should be: 21

sorry for asking this noobish qn.. but is it possible to post some example codes?

Originally Posted by copeg

phamminh91 has given some great pseudo-code to begin with. Recommend you give it a go, break the problem down as phamminh91 has outlined and do this step by step...I will note that you've posted a solution using a while loop, and you may find it easier to use a recursive approach. The following link provides some great descriptions and examples to tackle the problem
Binary Trees

Oops, I am not supposed to post the exact code LOL .