We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 8c5e2f8 commit 2b7d245Copy full SHA for 2b7d245
doc/source/9_trees_and_directed_acyclic_graphs.rst
@@ -287,7 +287,7 @@ Data structures for trees
287
<https://imperial.cloud.panopto.eu/Panopto/Pages/Viewer.aspx?id=5477e1b1-1040-4a07-97a5-aceb01230fc6>`__.
288
289
Unlike the sequence types we have previously met, trees are not linear objects.
290
-If we wish to iterate through every node in the tree then we have a choices to
+If we wish to iterate through every node in the tree then we have choices to
291
make about the order in which we do so. In particular, there are two obvious
292
classes of traversal order:
293
0 commit comments