Design calculator with HashMap

[Angelica Maria]

Hello
I started in java and I developed a calculator, then I put my affairs in a stringBuffer

gender (45 * 34 + 89)

I want to send this StringBuffer implements a tree in the order of precedence of operations, then I saw the HashMap. Now, my question is that, Is it a good ideas to using the hashmap in designing calculator. Any help is appreciated. Thanks in advance.

[New ID]

Hello,
I am also thinking of using the hashmap in designing something like calculator. I watched how the operations walked into a binary tree but I do not see how walking with a hashmap. Please guide me if I am wrong. Value takes a number and then successively operator
Here is an example

could(key,25)
could(key +)
could(key,44)
could(key *)
could(key,8)

but I do not know what can match the key. Any help will be great. Thanks

[cyber-noob]

Hello,
I thought for a moment that you would just take the operators as keys and ordered by increasing priority.There are several ways to proceed:
One way is to determine the algorithm used to route to the operations. It has such expression prefix or inverted post-fix. Then it will just Use (Class Stack) to stack and unstack the operands. Otherwise there is the TreeMap class that implements binary trees. An elegant way is to use a composite design pattern. I do not know if any of my proposals you agree.

[Linux-Us]

Hello,
You can try the following example

2*3+3*2
gives
    Root
     /
    +
  / \
 * *
/ \ / \
2  3  3   2
 
2*(3+3)*2
gives
    Root
     /
    *
  / \
 *      2
/ \      
2  +
   / \
  3   3

[WinDoWLoCuS]

Hello,
I agree with the above code and it is the perfect way to proceed. To calculate: each node is a leaf if it has value, otherwise it is an operator, we take the result of a recursive subtree.
- Priority and therefore found the lowest in the tree.
Therefore a binary tree structure: Either tables Object [2], a class 2 attributes, one TreeNode (even if in Swing and it has not been integrated util). Hope this will help you.