author | nipkow |
Fri, 08 Jul 2016 16:38:31 +0200 | |
changeset 63413 | 9fe2d9dc095e |
parent 63036 | 1ba3aacfa4d3 |
child 63598 | 025d6e52d86f |
permissions | -rw-r--r-- |
57250 | 1 |
(* Author: Tobias Nipkow *) |
2 |
||
60500 | 3 |
section \<open>Binary Tree\<close> |
57250 | 4 |
|
5 |
theory Tree |
|
6 |
imports Main |
|
7 |
begin |
|
8 |
||
58424 | 9 |
datatype 'a tree = |
62160 | 10 |
is_Leaf: Leaf ("\<langle>\<rangle>") | |
11 |
Node (left: "'a tree") (val: 'a) (right: "'a tree") ("(1\<langle>_,/ _,/ _\<rangle>)") |
|
57449
f81da03b9ebd
Library/Tree: use datatype_new, bst is an inductive predicate
hoelzl
parents:
57250
diff
changeset
|
12 |
where |
f81da03b9ebd
Library/Tree: use datatype_new, bst is an inductive predicate
hoelzl
parents:
57250
diff
changeset
|
13 |
"left Leaf = Leaf" |
f81da03b9ebd
Library/Tree: use datatype_new, bst is an inductive predicate
hoelzl
parents:
57250
diff
changeset
|
14 |
| "right Leaf = Leaf" |
57569
e20a999f7161
register tree with datatype_compat ot support QuickCheck
hoelzl
parents:
57530
diff
changeset
|
15 |
datatype_compat tree |
57250 | 16 |
|
60500 | 17 |
text\<open>Can be seen as counting the number of leaves rather than nodes:\<close> |
58438 | 18 |
|
19 |
definition size1 :: "'a tree \<Rightarrow> nat" where |
|
20 |
"size1 t = size t + 1" |
|
21 |
||
22 |
lemma size1_simps[simp]: |
|
23 |
"size1 \<langle>\<rangle> = 1" |
|
24 |
"size1 \<langle>l, x, r\<rangle> = size1 l + size1 r" |
|
25 |
by (simp_all add: size1_def) |
|
26 |
||
62650 | 27 |
lemma size1_ge0[simp]: "0 < size1 t" |
28 |
by (simp add: size1_def) |
|
29 |
||
60507 | 30 |
lemma size_0_iff_Leaf: "size t = 0 \<longleftrightarrow> t = Leaf" |
60505 | 31 |
by(cases t) auto |
32 |
||
58424 | 33 |
lemma neq_Leaf_iff: "(t \<noteq> \<langle>\<rangle>) = (\<exists>l a r. t = \<langle>l, a, r\<rangle>)" |
34 |
by (cases t) auto |
|
57530 | 35 |
|
57687 | 36 |
lemma finite_set_tree[simp]: "finite(set_tree t)" |
37 |
by(induction t) auto |
|
38 |
||
59776 | 39 |
lemma size_map_tree[simp]: "size (map_tree f t) = size t" |
40 |
by (induction t) auto |
|
41 |
||
42 |
lemma size1_map_tree[simp]: "size1 (map_tree f t) = size1 t" |
|
43 |
by (simp add: size1_def) |
|
44 |
||
45 |
||
60808
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
46 |
subsection "The Height" |
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
47 |
|
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
48 |
class height = fixes height :: "'a \<Rightarrow> nat" |
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
49 |
|
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
50 |
instantiation tree :: (type)height |
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
51 |
begin |
59776 | 52 |
|
60808
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
53 |
fun height_tree :: "'a tree => nat" where |
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
54 |
"height Leaf = 0" | |
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
55 |
"height (Node t1 a t2) = max (height t1) (height t2) + 1" |
59776 | 56 |
|
60808
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
57 |
instance .. |
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
58 |
|
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
59 |
end |
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
60 |
|
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
61 |
lemma height_map_tree[simp]: "height (map_tree f t) = height t" |
59776 | 62 |
by (induction t) auto |
63 |
||
62202 | 64 |
lemma size1_height: "size t + 1 \<le> 2 ^ height (t::'a tree)" |
65 |
proof(induction t) |
|
66 |
case (Node l a r) |
|
67 |
show ?case |
|
68 |
proof (cases "height l \<le> height r") |
|
69 |
case True |
|
70 |
have "size(Node l a r) + 1 = (size l + 1) + (size r + 1)" by simp |
|
71 |
also have "size l + 1 \<le> 2 ^ height l" by(rule Node.IH(1)) |
|
72 |
also have "size r + 1 \<le> 2 ^ height r" by(rule Node.IH(2)) |
|
73 |
also have "(2::nat) ^ height l \<le> 2 ^ height r" using True by simp |
|
74 |
finally show ?thesis using True by (auto simp: max_def mult_2) |
|
75 |
next |
|
76 |
case False |
|
77 |
have "size(Node l a r) + 1 = (size l + 1) + (size r + 1)" by simp |
|
78 |
also have "size l + 1 \<le> 2 ^ height l" by(rule Node.IH(1)) |
|
79 |
also have "size r + 1 \<le> 2 ^ height r" by(rule Node.IH(2)) |
|
80 |
also have "(2::nat) ^ height r \<le> 2 ^ height l" using False by simp |
|
81 |
finally show ?thesis using False by (auto simp: max_def mult_2) |
|
82 |
qed |
|
83 |
qed simp |
|
84 |
||
57687 | 85 |
|
63036 | 86 |
subsection "Balanced" |
87 |
||
88 |
fun balanced :: "'a tree \<Rightarrow> bool" where |
|
89 |
"balanced Leaf = True" | |
|
90 |
"balanced (Node l x r) = (balanced l \<and> balanced r \<and> height l = height r)" |
|
91 |
||
92 |
lemma balanced_size1: "balanced t \<Longrightarrow> size1 t = 2 ^ height t" |
|
93 |
by (induction t) auto |
|
94 |
||
95 |
lemma balanced_size: "balanced t \<Longrightarrow> size t = 2 ^ height t - 1" |
|
96 |
using balanced_size1[simplified size1_def] by fastforce |
|
97 |
||
98 |
||
63413 | 99 |
subsection \<open>Path length\<close> |
100 |
||
101 |
text \<open>The internal path length of a tree:\<close> |
|
102 |
||
103 |
fun path_len :: "'a tree \<Rightarrow> nat" where |
|
104 |
"path_len Leaf = 0 " | |
|
105 |
"path_len (Node l _ r) = path_len l + size l + path_len r + size r" |
|
106 |
||
107 |
lemma path_len_if_bal: "balanced t |
|
108 |
\<Longrightarrow> path_len t = (let n = height t in 2 + n*2^n - 2^(n+1))" |
|
109 |
proof(induction t) |
|
110 |
case (Node l x r) |
|
111 |
have *: "2^(n+1) \<le> 2 + n*2^n" for n :: nat |
|
112 |
by(induction n) auto |
|
113 |
have **: "(0::nat) < 2^n" for n :: nat by simp |
|
114 |
let ?h = "height r" |
|
115 |
show ?case using Node *[of ?h] **[of ?h] by (simp add: balanced_size Let_def) |
|
116 |
qed simp |
|
117 |
||
118 |
||
57687 | 119 |
subsection "The set of subtrees" |
120 |
||
57250 | 121 |
fun subtrees :: "'a tree \<Rightarrow> 'a tree set" where |
60808
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
122 |
"subtrees \<langle>\<rangle> = {\<langle>\<rangle>}" | |
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
123 |
"subtrees (\<langle>l, a, r\<rangle>) = insert \<langle>l, a, r\<rangle> (subtrees l \<union> subtrees r)" |
57250 | 124 |
|
58424 | 125 |
lemma set_treeE: "a \<in> set_tree t \<Longrightarrow> \<exists>l r. \<langle>l, a, r\<rangle> \<in> subtrees t" |
126 |
by (induction t)(auto) |
|
57449
f81da03b9ebd
Library/Tree: use datatype_new, bst is an inductive predicate
hoelzl
parents:
57250
diff
changeset
|
127 |
|
57450 | 128 |
lemma Node_notin_subtrees_if[simp]: "a \<notin> set_tree t \<Longrightarrow> Node l a r \<notin> subtrees t" |
58424 | 129 |
by (induction t) auto |
57449
f81da03b9ebd
Library/Tree: use datatype_new, bst is an inductive predicate
hoelzl
parents:
57250
diff
changeset
|
130 |
|
58424 | 131 |
lemma in_set_tree_if: "\<langle>l, a, r\<rangle> \<in> subtrees t \<Longrightarrow> a \<in> set_tree t" |
132 |
by (metis Node_notin_subtrees_if) |
|
57449
f81da03b9ebd
Library/Tree: use datatype_new, bst is an inductive predicate
hoelzl
parents:
57250
diff
changeset
|
133 |
|
57687 | 134 |
|
59776 | 135 |
subsection "List of entries" |
136 |
||
137 |
fun preorder :: "'a tree \<Rightarrow> 'a list" where |
|
138 |
"preorder \<langle>\<rangle> = []" | |
|
139 |
"preorder \<langle>l, x, r\<rangle> = x # preorder l @ preorder r" |
|
57687 | 140 |
|
57250 | 141 |
fun inorder :: "'a tree \<Rightarrow> 'a list" where |
58424 | 142 |
"inorder \<langle>\<rangle> = []" | |
143 |
"inorder \<langle>l, x, r\<rangle> = inorder l @ [x] @ inorder r" |
|
57250 | 144 |
|
57449
f81da03b9ebd
Library/Tree: use datatype_new, bst is an inductive predicate
hoelzl
parents:
57250
diff
changeset
|
145 |
lemma set_inorder[simp]: "set (inorder t) = set_tree t" |
58424 | 146 |
by (induction t) auto |
57250 | 147 |
|
59776 | 148 |
lemma set_preorder[simp]: "set (preorder t) = set_tree t" |
149 |
by (induction t) auto |
|
150 |
||
151 |
lemma length_preorder[simp]: "length (preorder t) = size t" |
|
152 |
by (induction t) auto |
|
153 |
||
154 |
lemma length_inorder[simp]: "length (inorder t) = size t" |
|
155 |
by (induction t) auto |
|
156 |
||
157 |
lemma preorder_map: "preorder (map_tree f t) = map f (preorder t)" |
|
158 |
by (induction t) auto |
|
159 |
||
160 |
lemma inorder_map: "inorder (map_tree f t) = map f (inorder t)" |
|
161 |
by (induction t) auto |
|
162 |
||
57687 | 163 |
|
60500 | 164 |
subsection \<open>Binary Search Tree predicate\<close> |
57250 | 165 |
|
57450 | 166 |
fun (in linorder) bst :: "'a tree \<Rightarrow> bool" where |
58424 | 167 |
"bst \<langle>\<rangle> \<longleftrightarrow> True" | |
168 |
"bst \<langle>l, a, r\<rangle> \<longleftrightarrow> bst l \<and> bst r \<and> (\<forall>x\<in>set_tree l. x < a) \<and> (\<forall>x\<in>set_tree r. a < x)" |
|
57250 | 169 |
|
60500 | 170 |
text\<open>In case there are duplicates:\<close> |
59561 | 171 |
|
172 |
fun (in linorder) bst_eq :: "'a tree \<Rightarrow> bool" where |
|
173 |
"bst_eq \<langle>\<rangle> \<longleftrightarrow> True" | |
|
174 |
"bst_eq \<langle>l,a,r\<rangle> \<longleftrightarrow> |
|
175 |
bst_eq l \<and> bst_eq r \<and> (\<forall>x\<in>set_tree l. x \<le> a) \<and> (\<forall>x\<in>set_tree r. a \<le> x)" |
|
176 |
||
59928 | 177 |
lemma (in linorder) bst_eq_if_bst: "bst t \<Longrightarrow> bst_eq t" |
178 |
by (induction t) (auto) |
|
179 |
||
59561 | 180 |
lemma (in linorder) bst_eq_imp_sorted: "bst_eq t \<Longrightarrow> sorted (inorder t)" |
181 |
apply (induction t) |
|
182 |
apply(simp) |
|
183 |
by (fastforce simp: sorted_append sorted_Cons intro: less_imp_le less_trans) |
|
184 |
||
59928 | 185 |
lemma (in linorder) distinct_preorder_if_bst: "bst t \<Longrightarrow> distinct (preorder t)" |
186 |
apply (induction t) |
|
187 |
apply simp |
|
188 |
apply(fastforce elim: order.asym) |
|
189 |
done |
|
190 |
||
191 |
lemma (in linorder) distinct_inorder_if_bst: "bst t \<Longrightarrow> distinct (inorder t)" |
|
192 |
apply (induction t) |
|
193 |
apply simp |
|
194 |
apply(fastforce elim: order.asym) |
|
195 |
done |
|
196 |
||
59776 | 197 |
|
60505 | 198 |
subsection "The heap predicate" |
199 |
||
200 |
fun heap :: "'a::linorder tree \<Rightarrow> bool" where |
|
201 |
"heap Leaf = True" | |
|
202 |
"heap (Node l m r) = |
|
203 |
(heap l \<and> heap r \<and> (\<forall>x \<in> set_tree l \<union> set_tree r. m \<le> x))" |
|
204 |
||
205 |
||
61585 | 206 |
subsection "Function \<open>mirror\<close>" |
59561 | 207 |
|
208 |
fun mirror :: "'a tree \<Rightarrow> 'a tree" where |
|
209 |
"mirror \<langle>\<rangle> = Leaf" | |
|
210 |
"mirror \<langle>l,x,r\<rangle> = \<langle>mirror r, x, mirror l\<rangle>" |
|
211 |
||
212 |
lemma mirror_Leaf[simp]: "mirror t = \<langle>\<rangle> \<longleftrightarrow> t = \<langle>\<rangle>" |
|
213 |
by (induction t) simp_all |
|
214 |
||
215 |
lemma size_mirror[simp]: "size(mirror t) = size t" |
|
216 |
by (induction t) simp_all |
|
217 |
||
218 |
lemma size1_mirror[simp]: "size1(mirror t) = size1 t" |
|
219 |
by (simp add: size1_def) |
|
220 |
||
60808
fd26519b1a6a
depth -> height; removed del_rightmost (too specifi)
nipkow
parents:
60507
diff
changeset
|
221 |
lemma height_mirror[simp]: "height(mirror t) = height t" |
59776 | 222 |
by (induction t) simp_all |
223 |
||
224 |
lemma inorder_mirror: "inorder(mirror t) = rev(inorder t)" |
|
225 |
by (induction t) simp_all |
|
226 |
||
227 |
lemma map_mirror: "map_tree f (mirror t) = mirror (map_tree f t)" |
|
228 |
by (induction t) simp_all |
|
229 |
||
59561 | 230 |
lemma mirror_mirror[simp]: "mirror(mirror t) = t" |
231 |
by (induction t) simp_all |
|
232 |
||
57250 | 233 |
end |