Дерево на списке

#include <iostream>
 
#include <stdio.h>
 
 
struct Node
{
    void* m_pPayload;
    Node* m_pParent;
    Node* m_Children;
 
};
 
struct Person
{
    int m_Id;
};
 
//typedef bool (*NodeComparator)(void* pValue, void* pPayload);
 
/*bool Comp(void* pValue, void* pPayload)
{
    Person* pVal = (Person*)pValue;
    Person* pPay = (Person*)pPayload;
    if (pVal->m_Id == pPay->m_Id)
        return true;
    else
        return false;
}*/
 
 
Node* NewNode(void* pPayload)
{
    Node* pNode = new Node;
    pNode->m_pParent = nullptr;
    pNode->m_Children = 0;
    pNode->m_pPayload = pPayload;
    pNode->m_Children = nullptr;
    return pNode;
}
 
Person* NewPerson(int id)
{
    Person* p = new Person;
    p->m_Id = id;
    return p;
}
 
//Node* FindNode(Node* pParent, Node* m_pPayload, NodeComparator comparator)
 
 
 
void AppendChild(Node* pParent, Node* pNode)
{
    struct Node* new_node = (struct Node*)malloc(sizeof(struct Node));
 
    //struct Node* last = pParent;  /* used in step 5*/
 
    /* 2. put in the data  */
    new_node->m_pPayload = pNode;
 
    /* 3. This new node is going to be the last node, so make next of
          it as NULL*/
    new_node->m_Children = NULL;
 
    /* 4. If the Linked List is empty, then make the new node as head */
    if (pParent->m_Children == NULL)
    {
        pParent->m_Children = pNode;
       
    }
 
    /* 5. Else traverse till the last node */
    while (pParent->m_Children != NULL)
        pParent = pParent->m_Children;
 
    /* 6. Change the next of last node */
    pParent->m_Children = new_node;
    return;
 
}
 
 
void print(Node* head)
{
    struct Node* ptr;
    ptr = head;
    while (ptr != NULL)
    {
        printf("%d\n ", ((Person*)head->m_pPayload)->m_Id);
        head = head->m_Children;
    }
}
 
 
int main()
{
 
    Node* T = new Node;
 
    T = NewNode(NewPerson(5));
 
    AppendChild(T, NewNode(NewPerson(11)));
    AppendChild(T, NewNode(NewPerson(12)));
    AppendChild(T, NewNode(NewPerson(15)));
    AppendChild(T->m_Children, NewNode(NewPerson(15)));
    AppendChild(T->m_Children, NewNode(NewPerson(15)));
    AppendChild(T->m_Children->m_Children, NewNode(NewPerson(14)));
    
    
    print(T);
 
}