From 95e2fe57f6e4639f6ae9f1fef368829d5090dbf6 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Ale=C5=A1=20Smodi=C5=A1?= Date: Tue, 18 Aug 2015 16:06:19 +0200 Subject: Exported all problems from the SQLite database into the new directory structure. --- prolog/problems/trees/depthbt_2/common.py | 17 +++++++++++++++++ prolog/problems/trees/depthbt_2/en.py | 12 ++++++++++++ 2 files changed, 29 insertions(+) create mode 100644 prolog/problems/trees/depthbt_2/common.py create mode 100644 prolog/problems/trees/depthbt_2/en.py (limited to 'prolog/problems/trees/depthbt_2') diff --git a/prolog/problems/trees/depthbt_2/common.py b/prolog/problems/trees/depthbt_2/common.py new file mode 100644 index 0000000..9e26f21 --- /dev/null +++ b/prolog/problems/trees/depthbt_2/common.py @@ -0,0 +1,17 @@ +id = 140 +group = 'trees' +number = 45 +visible = True +facts = None + +solution = '''\ +depthBT(nil, 0). +depthBT(b(L, _, R), D) :- + depthBT(L, DL), + depthBT(R, DR), + (DL >= DR, + D is DL + 1 + ; + DL < DR, + D is DR + 1). +''' diff --git a/prolog/problems/trees/depthbt_2/en.py b/prolog/problems/trees/depthbt_2/en.py new file mode 100644 index 0000000..37cb3cd --- /dev/null +++ b/prolog/problems/trees/depthbt_2/en.py @@ -0,0 +1,12 @@ +id = 140 +name = 'depthBT/2' +slug = 'find the depth of a binary tree' + +description = '''\ +

depthBT(T, D): D is the depth of the binary tree T.

+
+  ?- depthBT(b(b(b(nil,4,nil),2,b(nil,6,nil)),1,nil), D).
+    D = 3.
+
''' + +hint = {} -- cgit v1.2.1