rust/comprehensive-rust
1
0
Fork 0
mirror of https://github.com/google/comprehensive-rust.git synced 2025-08-08 00:12:51 +02:00
Code Issues Releases Activity

Add note to binary-tree exercise about duplicate values (#2790)

Browse Source 
Just a small note to clarify a minor point of confusion with the
exercise.
This commit is contained in:
Nicole L
2025-07-25 02:11:17 -07:00
committed by GitHub
parent f37402066d
commit 047b2b2255
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
src/smart-pointers/exercise.md
View File

@ -7,7 +7,8 @@ minutes: 30
A binary tree is a tree-type data structure where every node has two children A binary tree is a tree-type data structure where every node has two children
(left and right). We will create a tree where each node stores a value. For a (left and right). We will create a tree where each node stores a value. For a
given node N, all nodes in a N's left subtree contain smaller values, and all given node N, all nodes in a N's left subtree contain smaller values, and all
nodes in N's right subtree will contain larger values. nodes in N's right subtree will contain larger values. A given value should only
be stored in the tree once, i.e. no duplicate nodes.
Implement the following types, so that the given tests pass. Implement the following types, so that the given tests pass.