what is the "best" block structure to code a tree structure?

[Arkady Andrukonis <grazingcows@yahoo.com>]

Hi,

I would like to find the easiest block structure to represent nested leaves and nodes in a tree structure that works for OCaml. In Common Lisp there is the help of indentation, but I haven't found one for OCaml.

We have one parent node composed of one leaf and a nested node which has  another node with two leaves and a leaf (of the second node). To help illustrate the level of depth we can use numbers 10, 20, and 30.
    (*
-------------------
our type definition
-------------------
    *)
# type tree = Node of tree * tree | Leaf of int;;
    (*
------------
and our tree
------------
    *)
# Node ((Leaf 10), (Node ((Node ((Leaf 20),(Leaf 30))), Leaf 30)));;
-: tree = Node (Leaf 10, Node (Node (Leaf 20, Leaf 30), Leaf 30))

Figuring out the two components to each node and grouping them within parentheses is exceedingly hard for nested nodes without using a block structure. It's great if I can figure this out, but the code is unmaintanable for anyone else. Would you say it is better when written as (I added the periods to prevent email client from removing the whitespace)

Node
..((Leaf 10), (Node
.....((Node ((Leaf 20),
........(Leaf 30))), Leaf 30)));;

or

Node
..((Leaf 10), (Node
................((Node
...................((Leaf 20), (Leaf 30))),
(Leaf 30)));;

or

Node
..((Leaf 10), (Node
................((Node ((Leaf 20), (Leaf 30))),
..............(Leaf 30)));;

I've checked the manual and it recommends using white space for clarity and intent. In symmetrical trees the code is beautiful, not so in asymmetrical ones. Tuareg only helps to match parentheses.

With kindest regards,

kadee