Scribd
Upload
9 views3 pages

Practical_8_DS

Uploaded by

Sujeet Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views3 pages

Practical_8_DS

Uploaded by

Sujeet Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Practical – 8

AIM: Write a C++ program to perform the following operations


a) Insertion into a B-tree
b) Deletion from a B-tree

Program:
#include <bits/stdc++.h>
using namespace std;

struct Node {
int key;
Node* left;
Node* right;
Node(int k) {
key = k;
left = right = NULL;
}
};

Node* getSuccessor(Node* curr) {


curr = curr->right;
while (curr != NULL && curr->left != NULL)
curr = curr->left;
return curr;
}

Node* delNode(Node* root, int x) {


// Base case
if (root == NULL)
return root;

// If key to be searched is in a subtree


if (root->key > x)
root->left = delNode(root->left, x);
else if (root->key < x)
root->right = delNode(root->right, x);

// If root matches with the given key


else {
// Cases when root has 0 children
// or only right child
if (root->left == NULL) {
Node* temp = root->right;
delete root;
return temp;
}

// When root has only left child


if (root->right == NULL) {
Node* temp = root->left;
delete root;
return temp;
}

// When both children are present


Node* succ = getSuccessor(root);
root->key = succ->key;
root->right = delNode(root->right, succ->key);
}
return root;
}

// A utility function to insert a new node with


// the given key
Node* insert(Node* node, int key) {
// If the tree is empty, return a new node
if (node == NULL)
return new Node(key);

// If the key is already present in the tree,


// return the node
if (node->key == key)
return node;

// Otherwise, recur down the tree/ If the key


// to be inserted is greater than the node's key,
// insert it in the right subtree
if (node->key < key)
node->right = insert(node->right, key);

// If the key to be inserted is smaller than


// the node's key, insert it in the left subtree
else
node->left = insert(node->left, key);

// Return the (unchanged) node pointer


return node;
}

// Utility function to do inorder traversal


void inorder(Node* root) {
if (root != NULL) {
inorder(root->left);
cout << root->key << " ";
inorder(root->right);
}
}

// Driver code
int main() {
// Creating the following BST
// 50
// / \
// 30 70
// / \ / \
// 20 40 60 80

Node* root = new Node(50);


root = insert(root, 30);
root = insert(root, 20);
root = insert(root, 40);
root = insert(root, 70);
root = insert(root, 60);
root = insert(root, 80);

// Print inorder traversal of the BST


cout << "Inorder traversal of the BST before deletion:\n";
inorder(root);
cout << endl;

// Delete node with key 15 and print inorder traversal


int x = 15;
root = delNode(root, x);

cout << "Inorder traversal of the BST after deletion:\n";


inorder(root);
cout << endl;

return 0;
}

Output:

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy