diff options
author | Timotej Lazar <timotej.lazar@fri.uni-lj.si> | 2016-04-11 00:10:57 +0200 |
---|---|---|
committer | Timotej Lazar <timotej.lazar@fri.uni-lj.si> | 2016-04-11 00:10:57 +0200 |
commit | acce0e01cdb2a57cda35e040035dbf1da6b96031 (patch) | |
tree | e5a08e4a45893463e7bacfd82454a1a07fecba69 /prolog/problems/trees/deletebt_3/sl.py | |
parent | 169c995732f3840aae6750479b49a4d0bcd4b198 (diff) |
Prolog: add test cases for the trees group
Diffstat (limited to 'prolog/problems/trees/deletebt_3/sl.py')
-rw-r--r-- | prolog/problems/trees/deletebt_3/sl.py | 13 |
1 files changed, 13 insertions, 0 deletions
diff --git a/prolog/problems/trees/deletebt_3/sl.py b/prolog/problems/trees/deletebt_3/sl.py new file mode 100644 index 0000000..7a1d930 --- /dev/null +++ b/prolog/problems/trees/deletebt_3/sl.py @@ -0,0 +1,13 @@ +name = 'deleteBT/3' +slug = 'izbriši element iz binarnega drevesa' + +description = '''\ +<p><code>deleteBT(X, T, NewT)</code>: binarno drevo <code>NewT</code> dobimo iz <code>T</code> tako, da izbrišemo eno pojavitev elementa <code>X</code>. Če <code>X</code> ni v listu, ga zamenjamo s korenom levega ali desnega poddrevesa. Program naj vrača vse veljavne rešitve.</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 = {} |