summaryrefslogtreecommitdiff
path: root/prolog/problems/trees/memberbt_2
diff options
context:
space:
mode:
Diffstat (limited to 'prolog/problems/trees/memberbt_2')
-rw-r--r--prolog/problems/trees/memberbt_2/en.py8
1 files changed, 4 insertions, 4 deletions
diff --git a/prolog/problems/trees/memberbt_2/en.py b/prolog/problems/trees/memberbt_2/en.py
index e8d48f2..1559151 100644
--- a/prolog/problems/trees/memberbt_2/en.py
+++ b/prolog/problems/trees/memberbt_2/en.py
@@ -6,10 +6,10 @@ slug = 'find elements in a binary tree'
description = '''\
<p><code>memberBT(X, T)</code>: <code>X</code> is an element of the binary tree <code>T</code>. A binary tree node is represented with the structure <code>b(L, E, R)</code>, where <code>L</code> and <code>R</code> are left and right subtrees, respectively, and <code>E</code> is the node's value. An empty tree is denoted by <code>nil</code>.</p>
<pre>
- ?- memberBT(X, b(b(nil,2,nil),1,b(nil,3,nil))).
- X = 1 ;
- X = 2 ;
- X = 3.
+?- memberBT(X, b(b(nil,2,nil),1,b(nil,3,nil))).
+ X = 1 ;
+ X = 2 ;
+ X = 3.
</pre>'''
hint = {}