Examples of trees.ExpressionTree

trees.ExpressionTree
Evaluates an arithmetic expression involving numbers (integers) and arithmetic operators of addition ("+"), subtraction ("-"), multiplication (".") and division ("/"). It is a full binary tree. Expressions are in infix format; meaning the operators are written in between the things on which they operate. The calculations represented by infix arithmetic expressions can be described quite naturally by full binary trees, where the leaves are labeled with numbers and the non-leaves are labeled with the operators. @version 1.0 Nov 21, 2010 @author Susanta Tewari

        
        super.executeImpl();


        DecimalFormat fmt = new DecimalFormat("0.####");


        ExpressionTree tree = ExpressionTree.demo();


        System.out.println("Infix expression of the tree: " + tree.infixExpression());


        System.out.println("Postfix expression of the tree: " + tree.postfixExpression());


        System.out.println("Expression evaluated at: " + fmt.format(tree.evaluate()));
        
    }

View Full Code Here

TOP

Related Classes of trees.ExpressionTree

console.command.Algo41Command

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.