Starting implementation tips for binary tree

turingschool · Dec 14, 2013 · a07b5e0 · a07b5e0
1 parent 82b9b68
commit a07b5e0
Showing 1 changed file with 9 additions and 0 deletions.
diff --git a/binary_trees/README.markdown b/binary_trees/README.markdown
@@ -16,3 +16,12 @@ A binary tree is built from *nodes*. Each node has:
 
 ### Sorting
 
+### Implementation Tips
+
+* Start with modeling a node
+* Then attach one node to another
+* Then attach multiple nodes together
+* Then implement search when there's just a single node
+* Then implement search for multiple nodes
+* Then implement sorted output for a single node
+* Then implement sorted output for multiple nodes