# Ternary Search Tree (Deletion)

In the SET 1 post on TST we have described how to insert and search a node in TST. In this article we will discuss algorithm on how to delete a node from TST.

During delete operation we delete the key in bottom up manner using recursion. The following are possible cases when deleting a key from trie.

1. Key may not be there in TST.
Solution : Delete operation should not modify TST.
2. Key present as unique key (no part of key contains another key (prefix), nor the key itself is prefix of another key in TST).
Solution : Delete all the nodes.
3. Key is prefix key of another long key in TST.
Solution : Unmark the leaf node.
4. Key present in TST, having atleast one other key as prefix key.
Solution : Delete nodes from end of key until first leaf node of longest prefix key.

Explanation for delete_node function

1. Let suppose we want to delete string “BIG”,since it is not present in TST so after matching with first character ‘B’, delete_node function will return zero. Hence nothing is deleted.
2. Now we want to delete string “BUG”, it is Uniquely present in TST i.e neither it has part which is the prefix of other string nor it is prefix to any other string, so it will be deleted completely.
3. Now we want to delete string “CAT”, since it is prefix of string “CATS”, we cannot delete anthing from the string “CAT” and we can only unmark the leaf node which will ensure that “CAT” is no longer a member string of TST.
4. Now we want to delete string “CATS”, since it has a prefix string “CAT” which also is a member string of TST so we can only delete last character of string “CATS” which will ensure that string “CAT” still remains the part of TST.

## C

 // C program to demonstrate deletion in // Ternary Search Tree (TST). For insert // and other functions, refer // https://www.geeksforgeeks.org/ternary-search-tree/ #include #include    // structure of a node in TST struct Node {     char key;     int isleaf;     struct Node *left;     struct Node *eq;     struct Node *right; };    // function to create a Node in TST struct Node *createNode(char key) {     struct Node *temp =         (struct Node*)malloc(sizeof(struct Node));     temp->key = key;     temp->isleaf = 0;     temp->left = NULL;     temp->eq = NULL;     temp->right = NULL;     return temp; };    // function to insert a Node in TST void insert_node(struct Node **root ,char *s) {     if (!(*root))         (*root) = createNode(*s);        if ((*s)<(*root)->key)         insert_node( &(*root)->left ,s);        else if ((*s)>(*root)->key)         insert_node( &(*root)->right ,s);        else if ((*s) == (*root)->key)     {         if (*(s+1) == '\0')         {             (*root)->isleaf = 1;             return;         }         insert_node( &(*root)->eq ,s+1);     } }    // function to display the TST void display(struct Node *root, char str[], int level) {     if (!root)         return;        display(root->left ,str ,level);     str[level] = root->key;        if (root->isleaf == 1)     {         str[level+1] = '\0';         printf("%s\n",str);     }        display(root->eq ,str ,level+1);     display(root->right ,str ,level); }    // to check if current Node is leaf node or not int isLeaf(struct Node *root) {     return root->isleaf == 1; }    // to check if current node has any child node or not int isFreeNode(struct Node *root) {     if (root->left ||root->eq ||root->right)         return 0;     return 1; }    // function to delete a string in TST int delete_node(struct Node *root, char str[],                 int level ,int n) {     if (root == NULL)         return 0;           // CASE 4 Key present in TST, having     // atleast one other key as prefix key.     if (str[level+1] == '\0')     {         // Unmark leaf node if present         if (isLeaf(root))         {             root->isleaf=0;             return isFreeNode(root);         }            // else string is not present in TST and         // return 0         else             return 0;     }     else     {         // CASE 3 Key is prefix key of another         // long key in TST.         if (str[level] < root->key)             delete_node(root->left ,str ,level ,n);         else if (str[level] > root->key)             delete_node(root->right ,str ,level ,n);            // CASE 1 Key may not be there in TST.         else if (str[level] == root->key)         {             // CASE 2 Key present as unique key             if( delete_node(root->eq ,str ,level+1 ,n) )             {                 // delete the last node, neither it                 // has any child                 // nor it is part of any other string                 free(root->eq);                 return !isLeaf(root) && isFreeNode(root);             }         }     }        return 0; }    // Driver function int main() {     struct Node *temp = NULL;        insert_node(&temp ,"CAT");     insert_node(&temp ,"BUGS");     insert_node(&temp ,"CATS");     insert_node(&temp ,"UP");        int level = 0;     char str[20];     int p = 0;        printf( "1.Content of the TST before "             "deletion:\n" );     display(temp ,str ,level);        level = 0;     delete_node(temp ,"CAT" ,level ,5);        level = 0;     printf("\n2.Content of the TST after "            "deletion:\n");     display(temp, str, level);     return 0; }

## C++

 // C++ program to demonstrate deletion in // Ternary Search Tree (TST) // For insert and other functions, refer // https://www.geeksforgeeks.org/ternary-search-tree    #include using namespace std;    // structure of a node in TST struct Node {     char key;     int isleaf;     struct Node *left;     struct Node *eq;     struct Node *right; };    // function to create a node in TST struct Node *createNode(char key) {     struct Node *temp = new Node;     temp->key = key;     temp->isleaf = 0;     temp->left = NULL;     temp->eq = NULL;     temp->right = NULL;     return temp; };    // function to insert a Node in TST void insert_node(struct Node **root, char *s) {     if (!(*root))     {         (*root) = createNode(*s);     }        if ((*s)<(*root)->key)         insert_node( &(*root)->left, s);        else if ((*s)>(*root)->key)         insert_node( &(*root)->right, s);        else if ((*s) == (*root)->key)     {         if (*(s+1) == '\0')         {             (*root)->isleaf = 1;             return;         }         insert_node( &(*root)->eq, s+1);     } }    // function to display the TST void display(struct Node *root, char str[], int level) {     if (!root)         return;        display(root->left, str, level);     str[level] = root->key;        if (root->isleaf == 1)     {         str[level+1] = '\0';         cout<< str <eq, str, level+1);     display(root->right, str, level); }    //to check if current node is leaf node or not int isLeaf(struct Node *root) {     return root->isleaf == 1; }    // to check if current node has any child // node or not int isFreeNode(struct Node *root) {     if (root->left ||root->eq ||root->right)         return 0;     return 1; }    // function to delete a string in TST int delete_node(struct Node *root, char str[],                 int level, int n) {     if (root == NULL)         return 0;           // CASE 4 Key present in TST, having atleast     // one other key as prefix key.     if (str[level+1] == '\0')     {         // Unmark leaf node if present         if (isLeaf(root))         {             root->isleaf = 0;             return isFreeNode(root);         }            // else string is not present in TST and         // return 0         else             return 0;     }        // CASE 3 Key is prefix key of another long     // key in TST.     if (str[level] < root->key)         return delete_node(root->left, str, level, n);     if (str[level] > root->key)         return delete_node(root->right, str, level, n);        // CASE 1 Key may not be there in TST.     if (str[level] == root->key)     {         // CASE 2 Key present as unique key         if (delete_node(root->eq, str, level+1, n))         {             // delete the last node, neither it has             // any child nor it is part of any other             // string             delete(root->eq);             return !isLeaf(root) && isFreeNode(root);         }     }        return 0; }    // Driver function int main() {     struct Node *temp = NULL;        insert_node(&temp, "CAT");     insert_node(&temp, "BUGS");     insert_node(&temp, "CATS");     insert_node(&temp, "UP");        int level = 0;     char str[20];     int p = 0;        cout << "1.Content of the TST before deletion:\n";     display(temp, str, level);        level = 0;     delete_node(temp,"CAT", level, 5);        level = 0;     cout << "\n2.Content of the TST after deletion:\n";     display(temp, str, level);     return 0; }

Output:

1.Content of the TST before deletion:
BUGS
CAT
CATS
UP

2.Content of the TST after deletion:
BUGS
CATS
UP

This article is contributed by Yash Singla. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

My Personal Notes arrow_drop_up