loading binary tree from string (parent-left-right)
===

I have a binary tree that looks like this 

![enter image description here][1]  

the object that represents it looks like this (java) 

     public class node {
       private String value = "";
       private TreeNode aChild;
       private TreeNode bChild;
     ....
     }

I want to read the data and build the tree from a string.  
So I wrote some small method to serialize it and I have it like this     
(parent-left-right)  
0,null,O@1,left,A@2,left,C@3,left,D@4,left,E@4,right,F@1,right,B@  

Then I read it and I have it as a  list - objects in this order O,A,C,D,E,F,B

And now my question is - how to I build the tree?  
iterating and putting it on a stack, queue ?   
should I serialize on a different order ?   

(basically I want to learn the best practices for building a tree from string data)  
can you refer me to a link on that subject ?   


  [1]: http://i.stack.imgur.com/bUzbU.jpg