Your tree-creating thread should make local calls that roughly mirror:
```
one := createTreeNode(uint64(rand.Intn(1000)), "one")
...
...
@@ -144,8 +144,9 @@ You tree should make calls that roughly mirror:
SetLeft(one.oid, two.oid)
SetRight(one.oid, three.oid)
SetLeft(two.oid, four.oid)
// print.....
```
and then print out, for each node, the label, and the labels of the left and right children:
The tree mutation events should be added to the log and the tree should be created locally. It doesn't matter if you create nodes locally first or just do the actual creation when they come through the log. Your code should then print a representation of the tree structure, such as:
