From 95e2fe57f6e4639f6ae9f1fef368829d5090dbf6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ale=C5=A1=20Smodi=C5=A1?= <aless@guru.si>
Date: Tue, 18 Aug 2015 16:06:19 +0200
Subject: Exported all problems from the SQLite database into the new directory
 structure.

---
 prolog/problems/trees/memberbt_2/en.py | 14 ++++++++++++++
 1 file changed, 14 insertions(+)
 create mode 100644 prolog/problems/trees/memberbt_2/en.py

(limited to 'prolog/problems/trees/memberbt_2/en.py')

diff --git a/prolog/problems/trees/memberbt_2/en.py b/prolog/problems/trees/memberbt_2/en.py
new file mode 100644
index 0000000..fcca1d9
--- /dev/null
+++ b/prolog/problems/trees/memberbt_2/en.py
@@ -0,0 +1,14 @@
+id = 135
+name = 'memberBT/2'
+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.
+</pre>'''
+
+hint = {}
-- 
cgit v1.2.1