Construct binary tree from prefix order expression -

how should construct binary tree of following "prefix" order expression?

( - * / 8 + 5 1 4 + 3 - 5 / 18 6 )

is there rule follow drawing tree?

pseudocode this:

function makebinarytree(expr):   element = next element in expr   if element number:     return leaf node of number   else: // element operator     left = makebinarytree(expr)     right = makebinarytree(expr)     return binary tree subtrees left , right , operator element 

here expr keeps internal pointer pointing next element is.