summaryrefslogtreecommitdiff
path: root/prolog/problems/trees/deletebt_3
diff options
context:
space:
mode:
authorTimotej Lazar <timotej.lazar@fri.uni-lj.si>2016-01-13 13:51:15 +0100
committerTimotej Lazar <timotej.lazar@fri.uni-lj.si>2016-01-13 13:51:15 +0100
commit388b32039898cc8f1784378689007254eb7a33b6 (patch)
treeac9e4c6145ad323dc5479179a04f44bbcea73eff /prolog/problems/trees/deletebt_3
parente36a8a2feca7552d236c0f6e89ac73e7e690e7b1 (diff)
Remove space-padding from <pre> blocks
Diffstat (limited to 'prolog/problems/trees/deletebt_3')
-rw-r--r--prolog/problems/trees/deletebt_3/en.py8
1 files changed, 4 insertions, 4 deletions
diff --git a/prolog/problems/trees/deletebt_3/en.py b/prolog/problems/trees/deletebt_3/en.py
index 215fced..eedab0a 100644
--- a/prolog/problems/trees/deletebt_3/en.py
+++ b/prolog/problems/trees/deletebt_3/en.py
@@ -6,10 +6,10 @@ 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)).
+?- 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 = {}