Solved

Tree Traversal

Posted on 2006-06-12
20
345 Views
Last Modified: 2008-03-10
I have a k-ary tree in the form of

           or
         /    \
       and     i
      /   \
     a     e
 
 

where "or" and "and" are operators. i need to traverse the tree and display the values in infix notation. Example


(a and e) or i

If "or" is the root node then as per the API I am using
root.jjtGetChild(0) will give me "and"
root.jjtGetChild(1) will give me "i"
root.jjtGetChild(0).jjtGetChild(0) will give me "a"
root.jjtGetChild(0).jjtGetChild(1) will give me "e"

I have written a small program for this


 private StringBuffer traverse(Node aoTreeNode, StringBuffer aoInfix,
            boolean closeBraces) {
        String asCurrentNode = aoTreeNode.toString();
       
        int liChildCount = aoTreeNode.jjtGetNumChildren();
        if (liChildCount == 0) {
            aoInfix.append(asCurrentNode);
            if (closeBraces)
                aoInfix.append(")");
        } else if (liChildCount == 1) {
            aoInfix.append(" ");
            aoInfix.append(asCurrentNode);
            aoInfix.append("(");
            traverse(aoTreeNode.jjtGetChild(0), aoInfix, false);
            aoInfix.append(")");
            if (closeBraces)
                aoInfix.append(")");
        } else {
            for (int liBraceCntr = 0; liBraceCntr < liChildCount - 1; liBraceCntr++) {
                aoInfix.append("(");
            }
            for (int liChildCntr = 0; liChildCntr < liChildCount; liChildCntr++) {
                traverse(aoTreeNode.jjtGetChild(liChildCntr), aoInfix,
                        (liChildCntr >= 1 && liChildCount >= 2) ? true : false);
                if (liChildCntr < liChildCount - 1) {
                    aoInfix.append(" ");
                    aoInfix.append(asCurrentNode);
                    aoInfix.append(" ");
                }
            }
        }
        Logger.getInstance().writeLog("Infix Query in traverse() method - "+aoInfix);
        return aoInfix;
    }
The program works fine for the above scenario.
But if I change it to
 
           
           and
          /    \
         a      or
               /  \
              b    c
It gets messed up with unbalanced braces. I am unable to figure out the problem, please help me.
also its a k-ary tree and can be n levels deep.
Its very important to keep the braces. For instance I can't do something like "a and b or c".

Thanks
0
Comment
Question by:thomas908
  • 10
  • 7
  • 2
20 Comments
 
LVL 92

Expert Comment

by:objects
ID: 16891697
I'd be coding it more like this:

StringBuffer traverse(Node aoTreeNode)  {

       String asCurrentNode = aoTreeNode.toString();
       int liChildCount = aoTreeNode.jjtGetNumChildren();
        if (liChildCount == 0) {

            return new StringBuffer(asCurrentNode);

        } else if (liChildCount == 1) {

            StringBuffer buf = new StringBuffer();
            buf.append(asCurrentNode);
            buf.append("(");
            buf.append(traverse(aoTreeNode.jjtGetChild(0)));
            buf.append(")");
            return buf;

        } else {
           
            StringBuffer buf = new StringBuffer();
            for (int liChildCntr = 0; liChildCntr < liChildCount; liChildCntr++) {
               buf.append("(");
               buf.append(traverse(aoTreeNode.jjtGetChild(liChildCntr)));
               if (liChildCntr<liChildCount-1) buf.append(asCurrentNode);
               buf.append(")");
            }
            return buf;
       }
}
0
 

Expert Comment

by:vpaturu
ID: 16891768
see this link http://forum.java.sun.com/thread.jspa?threadID=541976&messageID=2628883

hope this helps

Regards,
Venkat.
0
 

Expert Comment

by:vpaturu
ID: 16891773
0
 
LVL 8

Author Comment

by:thomas908
ID: 17072050
I am sorry to not have replied earlier. Please give me acouple of days to update this.

thanks
0
 
LVL 8

Author Comment

by:thomas908
ID: 17079133
>> I'd be coding it more like this:
Sorry objects, tt does not work even the scenario I have postd above. Braces get all messed up
Also there can be urinary operators like NOT, so I have to take care of braces for them also.
Say the user entered

(a and e) or not i

It'll be stored in the database as

 OR (  AND ( 'a', 'e' ) ,  NOT ( 'i' )  )

corrsponding tree will be something like

               OR
               /   \
            AND  NOT
             / \     \
           a   e    i

i need the traverse the tree in infix notation  and get back what the user entered, that is,  "(a and e) or not i"
Braces should be matching. Gettng some extra pais of braces is not a problem, such as getting
"(a and e) or not (i)" or "((a and e) or not (i))" is OK but getting "(a and e) or not i)" is not (as braces are not matching).
Also, "a and e or not i" (user is not allowed to enter this, so braces need to be shown) won't work, precendence needs to be  defined using braces, so it has to be "(a and e) or not i".  
Thank You all for your patience
0
 
LVL 92

Expert Comment

by:objects
ID: 17080101
how exactly would what i suggested not work?
and how could it generate non-matching braces, everywhere a ( is added a ) is also added.
0
 
LVL 8

Author Comment

by:thomas908
ID: 17080937
Thanks for replying

>> how exactly would what i suggested not work?

Say the user entered, "(a and e) or i"
It would be converted to "OR (  AND ( 'a', 'e' ) , 'i' )"
Now we need to get it back to the infix notaion (by traversing the tree)
Your program is giving the follwoing result

((Word<a>And)(Word<e>)Or)(Word<i>)
0
 
LVL 92

Expert Comment

by:objects
ID: 17086858
so have u implemented the code I posted above?
where is that output coming from?
0
 
LVL 8

Author Comment

by:thomas908
ID: 17087832
>> so have u implemented the code I posted above?
>>where is that output coming from?

Yes, I have implemented your code. The output is the one posted above

((Word<a>And)(Word<e>)Or)(Word<i>)

It is coming from the code you have posted.

Thank You
0
Highfive Gives IT Their Time Back

Highfive is so simple that setting up every meeting room takes just minutes and every employee will be able to start or join a call from any room with ease. Never be called into a meeting just to get it started again. This is how video conferencing should work!

 
LVL 92

Accepted Solution

by:
objects earned 500 total points
ID: 17087893
well it wasn't tested (nor could be) :)
For a start it looks like the toString() method for a node does not return what you need, so you'll need to call whatever method does.

looks like i put the closing brace in the wrong spot in the >1 child case

            StringBuffer buf = new StringBuffer();
            for (int liChildCntr = 0; liChildCntr < liChildCount; liChildCntr++) {
               buf.append("(");
               buf.append(traverse(aoTreeNode.jjtGetChild(liChildCntr)));
               buf.append(")");
               if (liChildCntr<liChildCount-1) buf.append(asCurrentNode);
            }
0
 
LVL 8

Author Comment

by:thomas908
ID: 17089280
Thanks you so much, objects. It works great.

"a and (b or cde)" entered by the user, and converted to a tree, is converted back to
 ( (a) And ( (b) Or (cde) ) )

Is it possible to make it
( a And ( b Or cde ) )   // removing the braces around the input

If it can be done then it'll be excellent. But even if it cannot be done, I think I can write a regular expression to strip the additional braces around the words(immediately preceding and following).

Thank You
 
0
 
LVL 92

Expert Comment

by:objects
ID: 17095682
to do that you'd need to check if the child nodes had leaves or not.
0
 
LVL 8

Author Comment

by:thomas908
ID: 17096782
Something like this...
StringBuffer traverse(Node aoTreeNode)  {

        String asCurrentNode = aoTreeNode.toString();
        int liChildCount = aoTreeNode.jjtGetNumChildren();
        if (liChildCount == 0) {
             return new StringBuffer(asCurrentNode);
         } else if (liChildCount == 1) {
             StringBuffer buf = new StringBuffer();
             buf.append(asCurrentNode);
             buf.append(" ");
             if(aoTreeNode.jjtGetChild(0) != null) {
                  buf.append("(");
             }
             buf.append(traverse(aoTreeNode.jjtGetChild(0)));
             if(aoTreeNode.jjtGetChild(0) != null) {
                 buf.append(")");
             }
             buf.append(" ");
             return buf;
         } else {        
             StringBuffer buf = new StringBuffer();
             for (int liChildCntr = 0; liChildCntr < liChildCount; liChildCntr++) {
                buf.append(" ");
                if(aoTreeNode.jjtGetChild(0) != null) {
                    buf.append("(");
                }
                buf.append(traverse(aoTreeNode.jjtGetChild(liChildCntr)));
                if(aoTreeNode.jjtGetChild(0) != null) {
                    buf.append(")");
                }
                buf.append(" ");
                if (liChildCntr<liChildCount-1)
                    buf.append(asCurrentNode);
             }
             
             
             Logger.getInstance().writeLog("Buffer Value - "+buf);
             return buf;
        }
 }

0
 
LVL 8

Author Comment

by:thomas908
ID: 17097615
The code I posted above doesn't work, can you please tell me where should I make the changes.
Thank You
0
 
LVL 92

Expert Comment

by:objects
ID: 17097686
u need to be checking the number of children of the node you are adding , something like:

             StringBuffer buf = new StringBuffer();
             buf.append(asCurrentNode);
             buf.append(" ");
             Node child = aoTreeNode.jjtGetChild(0);
             if(child.jjtGetNumChildren()>0) {
                  buf.append("(");
             }
             buf.append(traverse(child));
             if(child.jjtGetNumChildren()>0) {
                 buf.append(")");
             }
             buf.append(" ");
             return buf;
0
 
LVL 8

Author Comment

by:thomas908
ID: 17097785
thanks for replying
Still same result

 StringBuffer traverse(Node aoTreeNode)  {

        String asCurrentNode = aoTreeNode.toString();
        int liChildCount = aoTreeNode.jjtGetNumChildren();
        if (liChildCount == 0) {
             return new StringBuffer(asCurrentNode);
         } else if (liChildCount == 1) {
             StringBuffer buf = new StringBuffer();
             buf.append(asCurrentNode);
             buf.append(" ");
             if(aoTreeNode.jjtGetNumChildren()>0) {
                 buf.append("(");
             }
   
             buf.append(traverse(aoTreeNode.jjtGetChild(0)));

             if(aoTreeNode.jjtGetNumChildren()>0) {
                  buf.append(")");
             }
             buf.append(" ");
             return buf;
         } else {        
             StringBuffer buf = new StringBuffer();
             for (int liChildCntr = 0; liChildCntr < liChildCount; liChildCntr++) {
                buf.append(" ");
                if(aoTreeNode.jjtGetNumChildren()>0) {
                    buf.append("(");
                }
                buf.append(traverse(aoTreeNode.jjtGetChild(liChildCntr)));
                if(aoTreeNode.jjtGetNumChildren()>0) {
                   buf.append(")");
                }
                buf.append(" ");
                if (liChildCntr<liChildCount-1)
                    buf.append(asCurrentNode);
             }
             
             
             Logger.getInstance().writeLog("Buffer Value - "+buf);
             return buf;
        }
 }
0
 
LVL 92

Expert Comment

by:objects
ID: 17097812
your checking the number of childeren on the wroong tree node, you need to check if the node thats potentially in the braces.
ie. if its a leaf then no braces, o'wise add braces.
0
 
LVL 8

Author Comment

by:thomas908
ID: 17097840
Thank You so much, objects. You are simply incredible.
0
 
LVL 8

Author Comment

by:thomas908
ID: 17097848
Here is the updated code

 StringBuffer traverse(Node aoTreeNode)  {

        String asCurrentNode = aoTreeNode.toString();
        int liChildCount = aoTreeNode.jjtGetNumChildren();
        if (liChildCount == 0) {
             return new StringBuffer(asCurrentNode);
         } else if (liChildCount == 1) {
             StringBuffer buf = new StringBuffer();
             buf.append(asCurrentNode);
             buf.append(" ");
             if(aoTreeNode.jjtGetChild(0).jjtGetNumChildren()>0) {
                 buf.append("(");
             }
   
             buf.append(traverse(aoTreeNode.jjtGetChild(0)));

             if(aoTreeNode.jjtGetChild(0).jjtGetNumChildren()>0) {
                  buf.append(")");
             }
             buf.append(" ");
             return buf;
         } else {        
             StringBuffer buf = new StringBuffer();
             for (int liChildCntr = 0; liChildCntr < liChildCount; liChildCntr++) {
                buf.append(" ");
                if(aoTreeNode.jjtGetChild(liChildCntr).jjtGetNumChildren()>0) {
                    buf.append("(");
                }
                buf.append(traverse(aoTreeNode.jjtGetChild(liChildCntr)));
                if(aoTreeNode.jjtGetChild(liChildCntr).jjtGetNumChildren()>0) {
                   buf.append(")");
                }
                buf.append(" ");
                if (liChildCntr<liChildCount-1)
                    buf.append(asCurrentNode);
             }
             
             
             Logger.getInstance().writeLog("Buffer Value - "+buf);
             return buf;
        }
 }
0

Featured Post

How to run any project with ease

Manage projects of all sizes how you want. Great for personal to-do lists, project milestones, team priorities and launch plans.
- Combine task lists, docs, spreadsheets, and chat in one
- View and edit from mobile/offline
- Cut down on emails

Join & Write a Comment

Introduction This article is the second of three articles that explain why and how the Experts Exchange QA Team does test automation for our web site. This article covers the basic installation and configuration of the test automation tools used by…
In this post we will learn how to connect and configure Android Device (Smartphone etc.) with Android Studio. After that we will run a simple Hello World Program.
Viewers learn how to read error messages and identify possible mistakes that could cause hours of frustration. Coding is as much about debugging your code as it is about writing it. Define Error Message: Line Numbers: Type of Error: Break Down…
Viewers will learn how to properly install Eclipse with the necessary JDK, and will take a look at an introductory Java program. Download Eclipse installation zip file: Extract files from zip file: Download and install JDK 8: Open Eclipse and …

708 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question

Need Help in Real-Time?

Connect with top rated Experts

12 Experts available now in Live!

Get 1:1 Help Now