Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    3.1 Worksheet DAA Lab

    Uploaded by

    Aryan kapoor

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content

    You might also like

    3.1 Worksheet DAA Lab

    Uploaded by

    Aryan kapoor
    7 views19 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    Download as pdf
    7 views19 pages

    3.1 Worksheet DAA Lab

    Uploaded by

    Aryan kapoor

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    Download as pdf
    of 19
    DEPARTMENT OF NAAC (3 ACADEMIC AFFAIRS -cOIEDUERSTY BEER Oiscover Leon, 20CSP-285: Design and Analysis of Algorithms Lab Worksheet: 3.1 Student Name: Rishikant Kumar UID: 20BCS3958 Branch: CSE (Big Data Analytics) Section/Group: 20BDA-2_B Semester: 4 Date of Performance: 07.05.2022 Subject Name: Design and analysis of algorithms lab Subject Code: 20CSP-285 Aim/Overview of the practical: Write a program to implement insert and delete nodes in a Red-Black tree. The task to be done: 1. WAP to implement insert and delete nodes in a Red-Black tree. 2. Paste the output. Apparatus: © Dev C++ eg DEPARTMENT OF NAAC oy ACADEMIC AFFAIRS SRA Re BEER Discover Learn. & Source Code: #include #include using namespace std; enum COLOR { RED, BLACK }; class Node { public: int val; COLOR color; Node “left, “right, *parent; Node(int val) : val(val) { parent = left = right = NULL; Il Node is created during insertion 1! Node is red at insertion color = RED; } Il returns pointer to uncle Node *uncle() { IIIf no parent or grandparent, then no uncle if (parent == NULL or parent->parent == NULL) return NULL; if (parent->isOnLeft()) Jt uncle on right return parent->parent->right; Yelena DEPARTMENT OF NAAC oy ACADEMIC AFFAIRS SRA Re BEER Discover Learn. & else Juncle on left return parent->parent->left; } | check if node is left child of parent bool isOnLeft() { return this == parent->left; } 1! returns pointer to sil Node *sibling() { | sibling null if no parent if (parent ULL) return NULL; if (isOnLeft()) return parent->right; return parent->left; } /1 moves node down and moves given node in its place void moveDown(Node *nParent) { if (parent != NULL) { if (isOnLeft()) { parent->left = nParent; jelse{ parent->right = nParent; } } nParent->parent = parent; parent = nParent; Yelena DEPARTMENT OF NAAC oy ACADEMIC AFFAIRS SRA Re BEER Discover Learn. & bool hasRedChild() { return (left != NULL and left->color == RED) or (right != NULL and right->color == RED); } k class RBTree { Node *root; Jl left rotates the given node void leftRotate(Node *x) { // new parent will be node's right child Node ‘nParent = x->right; // update root if current node is root if (x == root) root = nParent; x->moveDown(nParent); II connect x with new parent's left element x->right = nParent->left; i connect new parent's left element with node Jif it is not null if (nParent->left != NULL) nParent->left->parent = x; I! connect new parent with x nParent-: =x; Yelena DEPARTMENT OF NAAC fs ACADEMIC AFFAIRS SRA Re BREE Discover Lear, void rightRotate(Node *x) { } // new parent will be node's left child Node *nParent = x->left; // update root if current node is root if (x == root) root = nParent; x->moveDown(nParent); // connect x with new parent's right element x->left = nParent->right; // connect new parent's right element with node Jif it is not null if (nParent->right != NULL) nParent->right->parent = x; // connect new parent with x nParent->right = x; void swapColors(Node *x1, Node *x2) { } COLOR temp; temp = x1->color; %1->color = x2->color; x2->color = temp; void swapValues(Node *u, Node *v) { int temp; temp = u->val; u->val = v->val Yelena DEPARTMENT OF NAAC oy ACADEMIC AFFAIRS SRA Re BEER Discover Learn. & } Jl fix red red at given node void fixRedRed(Node *x) { Jif x is root color it black and return if ( oot) { x->color = BLACK; return; } // initialize parent, grandparent, uncle Node ‘parent = x->parent, ‘grandparent = parent->parent, *uncle = x->uncle(); if (parent->color != BLACK) { if (uncle I= NULL && uncle->color == RED) { ‘uncle red, perform recoloring and recurse parent->color = BLACK; uncle->color = BLACK; grandparent->color = RED; fixRedRed(grandparent); } else { 1 Else perform LR, LL, RL, RR if (parent->isOnLeft()) { if (x->isOnLeft()) { 1! for left right swapColors(parent, grandparent); }else { leftRotate(parent); swapColors(x, grandparent); } Yelena DEPARTMENT OF NAAC oy ACADEMIC AFFAIRS SRA Re BEER Discover Learn. & /! for left left and left right rightRotate(grandparent); yelse { if (x->isOnLeft()) { // for right left rightRotate(parent); swapColors(x, grandparent); }else{ swapColors(parent, grandparent); } / for right right and right left leftRotate(grandparent); } } } } 1 find node that do not have a left child // in the subtree of the given node Node *successor(Node *x) { Node *temp = x; while (temp->left != NULL) temp = temp->left; return temp; } J! find node that replaces a del Node “BSTreplace(Node “x) { ij! when node have 2 children Yelena ted node in BST DEPARTMENT OF cu ACADEMIC AFFAIRS BEER Discover Learn. & if (x->left = NULL and x->right != NULL) return successor(x->right); i when leat if (x->left == NULL and x->right == NULL) return NULL; J when single child if (x-> left 1= NULL) return x->left; else return x->right; } | deletes the given node void deleteNode(Node *v) { Node “u = BSTreplace(v); i True when u and v are both black bool uvBlack = ((u == NULL or u->color == == BLACK)); Node *parent = v->parent; if (u == NULL) { NULL therefore v is leaf root) { root, making root null root = NULL; } else { if (uvBlack) { //u and v both black Jw is leaf, fix double black at v Yelena NAAC GRADE. ‘ACCREDITED UNEASY BLACK) and (v->color DEPARTMENT OF NAAC 2} ACADEMIC AFFAIRS SRApe ‘ACCREDITED UNEASY BEER Discover Learn. & fixDoubleBlack(v); }else{ Juorvisred if (v->sibling() != NULL) / sibling is not null, make it red" v->sibling()->color = RED; } 1 delete v from the tree if (v->isOnLeft()) { parent->left = NULL; }else{ parent->right = NULL; } } delete v; return; } if (v->left == NULL or v->right == NULL) { itv has 1 child if (v == root) { 1 v is root, assign the value of u to v, and delete u v->val = u->valj v->left = v->right = NULL; delete u; } else { /! Detach v from tree and move u up if (v->isOnLeft()) { parent->left = u; }else { parent->right = u; Yelena } DEPARTMENT OF NAAC oy ACADEMIC AFFAIRS SRA Re BEER Discover Learn. & } delete v; u->parent = parent; if (uvBlack) { //u and v both black, fix double black at u fixDoubleBlack(u); else { Ju or v red, color u black u->color = BLACK; } } return; } iv has 2 children, swap values with successor and recurse swapValues(u, v); deleteNode(u); void fixDoubleBlack(Node *x) { if (x root) I Reached root return; g = x->sibling(), *parent = x->parent; ing, double black pushed up fixDoubleBlack(parent); g->color == RED) { II Sibling red parent->color = RED; Yelena DEPARTMENT OF NAAC 9 ACADEMIC AFFAIRS SRA Re ->color = BLACK; ing->isOnLeft()) { J left case rightRotate(parent); else { Jl right case leftRotate(parent); } fixDoubleBlack(x); J else { 1 Sibling black if (sibling->hasRedChild()) { / at least 1 red children if (sibling->left != NULL and sibling->left->color == RED) { if (sibling->isOnLeft()) { I left left sibling->left->color = sibling->color; sibling->color = parent->color; rightRotate(parent); }else{ right left sibling->left->color = parent->color; rightRotate(sibling); leftRotate(parent); } yelse{ if (sibli g->isOnLeft()) { I left right sibling->right->color = parent->color; leftRotate(sibling); rightRotate(parent); } else { Yelena DEPARTMENT OF NAAC oy ACADEMIC AFFAIRS SRA Re BEER Discover Learn. & right right sibling->right->color = sibling->color; sibling->color = parent->color; leftRotate(parent); } } parent->color = BLACK; }else{ 12 black children sibling->color = RED; if (parent->color == BLACK) fixDoubleBlack(parent); else parent->color = BLACK; } II prints level order for given node void levelOrder(Node *x) { if ( NULL) // return if node is null return; i! queue for level order queue q; Node ‘curr; I push x q-push(x); Yelena DEPARTMENT OF NAAC oy ACADEMIC AFFAIRS SRA Re BEER Discover Learn. & whi iwi (Iq.empty()) { qis not empty I dequeue curr = q.front(); q-pop(); 1 print node value cout << curr->val <<" "5 i push children to queue if (curr->left != NULL) q.-push(curr->left); if (curr->right != NULL) q-push(curr->right); } } /! prints inorder recursively void inorder(Node *x) { inorder(x->left); cout << x->val << ""; inorder(x->right); } public: /! constructor I initi: e root RBTree() { root = NULL; } Node *getRoot() { return root; } DEPARTMENT OF NAAC oy ACADEMIC AFFAIRS SRA Re BEER Discover Learn. & Il searches for given value if found returns the node (used for di fe) /! else returns the last node while traversing (used in insert) Node *search(int n) { Node *temp = root; while (temp != NULL) { if (n < temp->val) { if (temp->left == NULL) break; else temp = temp->left; } else if (n temp->val) { break; }else{ if (temp->right == NULL) break; else temp = temp->right; } } return temp; } /l inserts the given value to tree void insert(int n) { Node *newNode = new Node(n); if (root == NULL) { i when root is null i simply insert value at root newNode->color = BLACK; Yelena DEPARTMENT OF NAAC oy ACADEMIC AFFAIRS SRA Re BEER Discover Learn. & root = newNode; jelse{ Node *temp = search(n); if (temp->val == n) { // return if value already exists return; } // if value is not found, search returns the node / where the value is to be inserted // connect new node to correct node newNode->parent = temp; if (n < temp->val) jeft = newNode; temp->right = newNode; i! fix red red voilaton if exists fixRedRed(newNode); } } // utility function that deletes the node with given value void deleteByVal(int n) { NULL) Node *v = search(n), *u; Yelena DEPARTMENT OF NAAC oy ACADEMIC AFFAIRS SRA Re << n << endl; deleteNode(v); } /| prints inorder of the tree void printInOrder() { cout << "Inorder: " << endl; if (root == NULL) cout << "Tree is empty" << endl; else inorder(root); cout << endl; } prints level order of the tree void printLevelOrder() { evel order: " << endl; NULL) cout << "Tree is empty" << endl; else levelOrder(root); cout << endl; } k int main() ( RBTree tree; Yelena DEPARTMENT OF cu ACADEMIC AFFAIRS tree.insert(8); tree.insert(11); tree.insert(26); tree.insert(2); tree.insert(13); tree.printInOrder(); tree.printLevelOrder(); cout<

    You might also like