From ae3e05247241d0184ffc8201fad4d9130c8a3107 Mon Sep 17 00:00:00 2001
From: "Peter J. Keleher" <keleher@cs.umd.edu>
Date: Tue, 16 Nov 2021 16:40:32 -0500
Subject: [PATCH] auto

---
 p5/README.md | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/p5/README.md b/p5/README.md
index ec9b031..00ef2bd 100644
--- a/p5/README.md
+++ b/p5/README.md
@@ -134,7 +134,7 @@ read strings: [one two three]
 > 
 ```
 
-You tree should make calls that roughly mirror:
+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:
 ```
 > go run tree.go
 "one": "two", "three"
-- 
GitLab