rust/comprehensive-rust
1
0
Fork 0
mirror of https://github.com/google/comprehensive-rust.git synced 2025-07-04 05:40:29 +02:00
Code Issues Releases Activity

Add note to binary-tree exercise about duplicate values

Browse Source
This commit is contained in:
Nicole LeGare
2025-06-25 15:33:51 -07:00
parent f51f0dbb13
commit 3f6209fb8b
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
(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
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.