Left-Child Right-Sibling move a sibling to a child node? - c++

Question

I have for example a Left-Child Right-Sibling tree:
If for example, I want to make E (including its child nodes E,K,L,P,Q) a child to H node. So H will contain N,O, E(and its children)
I intend to add the children to the parent node, then delete the old nodes but then there are new parent-children pairs. What is the shortest way for this?
Here's some code to reproduce:
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
struct Node
{
string data;
struct Node *next;
struct Node *child;
};
// Creating new Node
Node* newNode(string data)
{
Node *newNode = new Node;
newNode->next = newNode->child = NULL;
newNode->data = data;
return newNode;
}
// Adds a sibling to a list with starting with n
Node *addSibling(Node *n, string data)
{
if (n == NULL)
return NULL;
while (n->next)
n = n->next;
return (n->next = newNode(data));
}
// Add child Node to a Node
Node *addChild(Node * n, string data)
{
if (n == NULL)
return NULL;
// Check if child list is not empty.
if (n->child)
return addSibling(n->child, data);
else
return (n->child = newNode(data));
}
// Traverses tree in level order
void traverseTree(Node * root)
{
if (root == NULL)
return;
while (root)
{
cout << " " << root->data;
if (root->child)
traverseTree(root->child);
root = root->next;
}
}
//Driver code
int main()
{
Node *root = newNode("A");
Node *nB = addChild(root, "B");
Node *nC = addChild(root, "C");
Node *nD = addChild(root, "D");
Node *nE = addChild(root, "E");
Node *nF = addChild(root, "F");
Node *nG = addChild(root, "G");
Node *nH = addChild(nB, "H");
Node *nI = addChild(nB, "I");
Node *nJ = addChild(nB, "J");
Node *nK = addChild(nE, "K");
Node *nL = addChild(nE, "L");
Node *nM = addChild(nG, "M");
Node *nN = addChild(nH, "N");
Node *nO = addChild(nH, "O");
Node *nP = addChild(nK, "P");
Node *nQ = addChild(nL, "Q");
traverseTree(root);
return 0;
}