diff options
author | Timotej Lazar <timotej.lazar@fri.uni-lj.si> | 2016-01-13 13:51:15 +0100 |
---|---|---|
committer | Timotej Lazar <timotej.lazar@fri.uni-lj.si> | 2016-01-13 13:51:15 +0100 |
commit | 388b32039898cc8f1784378689007254eb7a33b6 (patch) | |
tree | ac9e4c6145ad323dc5479179a04f44bbcea73eff /prolog/problems/trees/insertbt_3 | |
parent | e36a8a2feca7552d236c0f6e89ac73e7e690e7b1 (diff) |
Remove space-padding from <pre> blocks
Diffstat (limited to 'prolog/problems/trees/insertbt_3')
-rw-r--r-- | prolog/problems/trees/insertbt_3/en.py | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/prolog/problems/trees/insertbt_3/en.py b/prolog/problems/trees/insertbt_3/en.py index 08eb2cd..c0fa47c 100644 --- a/prolog/problems/trees/insertbt_3/en.py +++ b/prolog/problems/trees/insertbt_3/en.py @@ -6,11 +6,11 @@ slug = 'insert an element into a binary tree' description = '''\ <p><code>insertBT(X, T, NewT)</code>: the binary tree <code>NewT</code> is obtained from <code>T</code> by inserting the element <code>X</code> at a certain position. This is the opposite of the predicate <code>deleteBT/3</code>. Your code should generate all valid solutions.</p> <pre> - ?- insertBT(2, b(nil,1,nil), T). - T = b(b(nil,1,nil),2,nil) ; - T = b(nil,2,b(nil,1,nil)) ; - T = b(b(nil,2,nil),1,nil) ; - T = b(nil,1,b(nil,2,nil)). +?- insertBT(2, b(nil,1,nil), T). + T = b(b(nil,1,nil),2,nil) ; + T = b(nil,2,b(nil,1,nil)) ; + T = b(b(nil,2,nil),1,nil) ; + T = b(nil,1,b(nil,2,nil)). </pre>''' hint = {} |