Pattern evaluater

Question

I have some a string which needed to be evaluated in following pattern -

Input  => String testTree = "(1(2(4)())(3))";   
Output => {1,2,3,4,*,*,*}

Input  => String testTree2 = "(1(2(4)(5))(3()(4()(3))))";   
Output => {1,2,3,4,5,*,4,*,*,*,*,*,*,*,3}

Input  => String testTree3 = "(1()())";   
Output =>{1,*,*}

Above mention inputs have same pattern , where '()' or null is represented as '*'.Output is been saved to a int/string array , hence output form is like so.

Kindly suggest a method to evaluate such kind of pattern to the output form.

Take a look at the [Shunting Yard Algorithm](http://en.wikipedia.org/wiki/Shunting-yard_algorithm). — Anubian Noob, Aug 31 '14 at 23:45
This problem is a part of Binary tree generation , if see carefully the input cases are kind of binary tree string notation and the output is leve- order form of the input. — Being Coder, Aug 31 '14 at 23:46
There is no need of creating a binary tree here , its just i want to evaluate the input to output using some kind of logic , it can be hard coded too. — Being Coder, Sep 01 '14 at 00:23

score 1 · Answer 1 · answered Sep 03 '14 at 10:25

1

You could use the Interpreter pattern to read the input into a binary tree class.

answered Sep 03 '14 at 10:25

Waog

7,127
5
25
37

Pattern evaluater

1 Answers1