Exported all problems from the SQLite database into the new directory structure.

2 files changed, 31 insertions, 0 deletions

diff --git a/prolog/problems/trees/deletebt_3/common.py b/prolog/problems/trees/deletebt_3/common.py
new file mode 100644
index 0000000..76550f6
--- /dev/null
+++ b/prolog/problems/trees/deletebt_3/common.py
@@ -0,0 +1,17 @@
+id = 137
+group = 'trees'
+number = 47
+visible = True
+facts = None
+
+solution = '''\
+deleteBT(X, b(nil, X, nil), nil).
+deleteBT(X, b(b(Ls, E, Rs), X, R), b(L, E, R)) :-
+  deleteBT(E, b(Ls, E, Rs), L).
+deleteBT(X, b(L, X, b(Ls, E, Rs)), b(L, E, R)) :-
+  deleteBT(E, b(Ls, E, Rs), R).
+deleteBT(X, b(L, E, R), b(L1, E, R)) :-
+  deleteBT(X, L, L1).
+deleteBT(X, b(L, E, R), b(L, E, R1)) :-
+  deleteBT(X, R, R1).
+'''
diff --git a/prolog/problems/trees/deletebt_3/en.py b/prolog/problems/trees/deletebt_3/en.py
new file mode 100644
index 0000000..557efaa
--- /dev/null
+++ b/prolog/problems/trees/deletebt_3/en.py
@@ -0,0 +1,14 @@
+id = 137
+name = 'deleteBT/3'
+slug = 'delete an element from a binary tree'
+
+description = '''\
+<p><code>deleteBT(X, T, NewT)</code>: the binary tree <code>NewT</code> is obtained from <code>T</code> by deleting one occurence of the element <code>X</code>. If <code>X</code> is not a leaf node, the root of one of its subtrees is moved up. Your code should generate all valid solutions.</p>
+<pre>
+  ?- deleteBT(1, b(b(b(nil,4,nil),2,b(nil,6,nil)),1,b(nil,3,b(nil,5,nil))), T).
+    T = b(b(nil,4,b(nil,6,nil)),2,b(nil,3,b(nil,5,nil))) ;
+    T = b(b(b(nil,4,nil),6,nil),2,b(nil,3,b(nil,5,nil))) ;
+    T = b(b(b(nil,4,nil),2,b(nil,6,nil)),3,b(nil,5,nil)).
+</pre>'''
+
+hint = {}