main.cpp
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 |
#include <iostream> #include <cstdlib> using namespace std; /* Node Class Declaration */ class LeftistNode { public: int element; LeftistNode *left; LeftistNode *right; int npl; LeftistNode(int & element, LeftistNode *lt = NULL, LeftistNode *rt = NULL, int np = 0) { this->element = element; right = rt; left = lt, npl = np; } }; /* Class Declaration */ class LeftistHeap { public: LeftistHeap(); LeftistHeap(LeftistHeap &rhs); ~LeftistHeap(); bool isEmpty(); bool isFull(); int &findMin(); void Insert(int &x); void deleteMin(); void deleteMin(int &minItem); void makeEmpty(); void Merge(LeftistHeap &rhs); LeftistHeap & operator=(LeftistHeap &rhs); private: LeftistNode *root; LeftistNode *Merge(LeftistNode *h1, LeftistNode *h2); LeftistNode *Merge1(LeftistNode *h1, LeftistNode *h2); void swapChildren(LeftistNode * t); void reclaimMemory(LeftistNode * t); LeftistNode *clone(LeftistNode *t); }; /* Construct the leftist heap. */ LeftistHeap::LeftistHeap() { root = NULL; } /* Copy constructor. */ LeftistHeap::LeftistHeap(LeftistHeap &rhs) { root = NULL; *this = rhs; } /* Destruct the leftist heap. */ LeftistHeap::~LeftistHeap() { makeEmpty( ); } /* Merge rhs into the priority queue. * rhs becomes empty. rhs must be different from this. */ void LeftistHeap::Merge(LeftistHeap &rhs) { if (this == &rhs) return; root = Merge(root, rhs.root); rhs.root = NULL; } /* Internal method to merge two roots. Deals with deviant cases and calls recursive Merge1. */ LeftistNode *LeftistHeap::Merge(LeftistNode * h1, LeftistNode * h2) { if (h1 == NULL) return h2; if (h2 == NULL) return h1; if (h1->element < h2->element) return Merge1(h1, h2); else return Merge1(h2, h1); } /* Internal method to merge two roots. Assumes trees are not empty, and h1's root contains smallest item. */ LeftistNode *LeftistHeap::Merge1(LeftistNode * h1, LeftistNode * h2) { if (h1->left == NULL) h1->left = h2; else { h1->right = Merge(h1->right, h2); if (h1->left->npl < h1->right->npl) swapChildren(h1); h1->npl = h1->right->npl + 1; } return h1; } /* Swaps t's two children. */ void LeftistHeap::swapChildren(LeftistNode * t) { LeftistNode *tmp = t->left; t->left = t->right; t->right = tmp; } /* Insert item x into the priority queue, maintaining heap order. */ void LeftistHeap::Insert(int &x) { root = Merge(new LeftistNode(x), root); } /* Find the smallest item in the priority queue. Return the smallest item, or throw Underflow if empty. */ int &LeftistHeap::findMin() { return root->element; } /* Remove the smallest item from the priority queue. Throws Underflow if empty. */ void LeftistHeap::deleteMin() { LeftistNode *oldRoot = root; root = Merge(root->left, root->right); delete oldRoot; } /* Remove the smallest item from the priority queue. Pass back the smallest item, or throw Underflow if empty. */ void LeftistHeap::deleteMin(int &minItem) { if (isEmpty()) { cout<<"Heap is Empty"<<endl; return; } minItem = findMin(); deleteMin(); } /* Test if the priority queue is logically empty. Returns true if empty, false otherwise. */ bool LeftistHeap::isEmpty() { return root == NULL; } /* Test if the priority queue is logically full. Returns false in this implementation. */ bool LeftistHeap::isFull() { return false; } /* Make the priority queue logically empty. */ void LeftistHeap::makeEmpty() { reclaimMemory(root); root = NULL; } /* Deep copy. */ LeftistHeap &LeftistHeap::operator=(LeftistHeap & rhs) { if (this != &rhs) { makeEmpty(); root = clone(rhs.root); } return *this; } /* Internal method to make the tree empty. */ void LeftistHeap::reclaimMemory(LeftistNode * t) { if (t != NULL) { reclaimMemory(t->left); reclaimMemory(t->right); delete t; } } /* Internal method to clone subtree. */ LeftistNode *LeftistHeap::clone(LeftistNode * t) { if (t == NULL) return NULL; else return new LeftistNode(t->element, clone(t->left), clone(t->right), t->npl); } int main() { LeftistHeap h; LeftistHeap h1; LeftistHeap h2; for (int i = 0; i < 20; i++) { if (i % 2 == 0) { h.Insert(i); cout<<"Element"<<i<<" inserted in Heap 1"<<endl; } else { h1.Insert(i); cout<<"Element"<<i<<" inserted in Heap 2"<<endl; } } h.Merge(h1); h2 = h; for (int i = 0; i < 20; i++) { int x; h2.deleteMin(x); cout<<"Element "<<x<<" Deleted"<<endl; if (h2.isEmpty()) { cout<<"The Heap is Empty"<<endl; break; } } return 0; } |
