Heya, I'm having a spot of trouble trying to place a structured file into a binary tree. I'll try to explain what I'm trying to accomplish as best as I can.

I have a file, containing a binary tree structure that looks like this:
Code:
[(x,y)[...][...]]
example:
Code:
[(6,2)[(4,1)[(1,1)[][]][(5,4)[][]]][(9,3)[][]]]
after inserting into a tree should look like this:
Code:
             (6,2)
            /       \
      (4,2)       (9,3)
       /   \
 (1,1)  (5,4)
Basically, the ordered pairs are what I put into the tree and [] means an empty tree.

The problem is that I can sorta form an algorithm in my head, but I don't know how to go about coding this. So far, I've tried putting the structure into a character array and going one by one to search for the numbers, however I don't know how to set it up so that I can recursively build my tree.

Can anyone help me? I'm not looking for a detailed program, but just a simple setup to point me in the right direction.

Thank you for your time