diff --git a/src/smart-pointers/exercise.md b/src/smart-pointers/exercise.md
index 37b33725..bb253259 100644
--- a/src/smart-pointers/exercise.md
+++ b/src/smart-pointers/exercise.md
@@ -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.