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/memberbt_2 | |
parent | e36a8a2feca7552d236c0f6e89ac73e7e690e7b1 (diff) |
Remove space-padding from <pre> blocks
Diffstat (limited to 'prolog/problems/trees/memberbt_2')
-rw-r--r-- | prolog/problems/trees/memberbt_2/en.py | 8 |
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 = {} |