{"id":145794,"date":"2025-07-11T14:51:09","date_gmt":"2025-07-11T09:21:09","guid":{"rendered":"https:\/\/data-flair.training\/blogs\/?p=145794"},"modified":"2025-07-11T14:51:09","modified_gmt":"2025-07-11T09:21:09","slug":"family-tree-builder-in-data-structures","status":"publish","type":"post","link":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-data-structures\/","title":{"rendered":"DSA Project &#8211; Family Tree Builder"},"content":{"rendered":"<h3>Program 1<\/h3>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"generic\">\/\/Project: Family Tree Builder (Based on BT)\r\n\/*\r\nObjective:\r\nTo create a basic system that allows users to build, manage, and \r\nexplore a family tree structure, where each person can have parent-child \r\nrelationships.\r\nTree Data Structure: Each node represents a person. Nodes can have a parent and \r\nmultiple children.\r\nDynamic Memory Allocation: For creating new family members at runtime.\r\nRecursion: For displaying the tree or searching through it.\r\n\r\nKey Features:\r\n1. Add a New Family Member\r\n2. Set Parents \r\n2. Display the Entire Family Tree\r\n3.Search for a Member\r\n4.Show Ancestors\r\n\r\n*\/\r\n#include &lt;stdio.h&gt;\r\n#include &lt;stdlib.h&gt;\r\n#include &lt;string.h&gt;\r\n#include &lt;windows.h&gt;\r\n#define NAME_LENGTH 50\r\n\r\ntypedef struct Person\r\n {\r\n    char name[NAME_LENGTH];\r\n    struct Person* father;\r\n    struct Person* mother;\r\n    struct Person* next; \/\/ for linked list of all persons\r\n} Person;\r\n\r\nPerson* head = NULL; \/\/ start of linked list\r\n\r\n\/\/ Create a new person\r\nPerson* createPerson(char name[])      \/\/amit\r\n{\r\n    Person* newPerson = (Person*)malloc(sizeof(Person));\r\n    strcpy(newPerson-&gt;name, name);\r\n    newPerson-&gt;father = NULL;\r\n    newPerson-&gt;mother = NULL;\r\n    newPerson-&gt;next = NULL;\r\n\r\n    \/\/ Add to linked list\r\n    if (head == NULL) \r\n    {\r\n        head = newPerson;\r\n    } \r\n    else \r\n    {\r\n        Person* temp = head;\r\n        while (temp-&gt;next != NULL)\r\n            temp = temp-&gt;next;\r\n        temp-&gt;next = newPerson;\r\n    }\r\n    return newPerson;\r\n}\r\n\r\n\/\/ Search person by name\r\nPerson* findPerson(char name[]) \r\n{\r\n    Person* temp = head;\r\n    while (temp != NULL) {\r\n        if (strcmp(temp-&gt;name, name) == 0)\r\n            return temp;\r\n        temp = temp-&gt;next;\r\n    }\r\n    return NULL;\r\n}\r\n\r\n\/\/ Set parents\r\nvoid setParents(char childName[], char fatherName[], char motherName[]) \r\n{\r\n    Person* child = findPerson(childName);\r\n    Person* father = findPerson(fatherName);\r\n    Person* mother = findPerson(motherName);\r\n\r\n    if (child==NULL || father==NULL || !mother==NULL) \r\n    {\r\n        printf(\" One or more names not found. Make sure all persons are added.\\n\");\r\n        return;\r\n    }\r\n\r\n    child-&gt;father = father;\r\n    child-&gt;mother = mother;\r\n\r\n    printf(\" Parents set successfully for %s.\\n\", childName);\r\n}\r\n\r\n\/\/ Display family tree (basic)\r\nvoid displayPerson(Person* person, int level) \r\n{\r\n    if (person==NULL) \r\n    return;\r\n    for (int i = 0; i &lt; level; i++) \r\n     printf(\"  \");\r\n    \r\n    printf(\" %s\\n\", person-&gt;name);\r\n    if (person-&gt;father!=NULL || person-&gt;mother!=NULL) \r\n    {\r\n        for (int i = 0; i &lt; level + 1; i++) \r\n         printf(\"  \");\r\n        if (person-&gt;father) printf(\" Father: %s\\n\", person-&gt;father-&gt;name);\r\n        if (person-&gt;mother) \r\n        {\r\n            for (int i = 0; i &lt; level + 1; i++) \r\n            printf(\"  \");\r\n            printf(\" Mother: %s\\n\", person-&gt;mother-&gt;name);\r\n        }\r\n    }\r\n}\r\n\r\n\/\/ Display full tree\r\nvoid displayFamilyTree() \r\n{\r\n    Person* temp = head;\r\n    printf(\"\\n Family Tree:\\n\");\r\n    while (temp != NULL) \r\n    {\r\n        displayPerson(temp, 0);\r\n        temp = temp-&gt;next;\r\n    }\r\n}\r\n\r\n\/\/ Show ancestors\r\nvoid showAncestors(Person* person) \r\n{\r\n    if (person==NULL) \r\n    return;\r\n    printf(\" Ancestors of %s:\\n\", person-&gt;name);\r\n    if (person-&gt;father!=NULL) \r\n    {\r\n        printf(\" Father: %s\\n\", person-&gt;father-&gt;name);\r\n        showAncestors(person-&gt;father);\r\n    }\r\n    if (person-&gt;mother) \r\n    {\r\n        printf(\" Mother: %s\\n\", person-&gt;mother-&gt;name);\r\n        showAncestors(person-&gt;mother);\r\n    }\r\n}\r\n\r\n\/\/ Menu\r\nvoid menu() \r\n{\r\n    int choice;\r\n    char name[NAME_LENGTH], father[NAME_LENGTH], mother[NAME_LENGTH];\r\n\r\n    do {\r\n        printf(\"\\n=====  Family Tree Builder =====\\n\");\r\n        printf(\"1. Add Person\\n\");\r\n        printf(\"2. Set Parents\\n\");\r\n        printf(\"3. Display Family Tree\\n\");\r\n        printf(\"4. Search Person\\n\");\r\n        printf(\"5. Show Ancestors\\n\");\r\n        printf(\"6. Exit\\n\");\r\n        printf(\"Enter your choice: \");\r\n        scanf(\"%d\", &amp;choice);\r\n        getchar(); \/\/ clear newline\r\n\r\n        switch (choice) \r\n        {\r\n            case 1:\r\n                printf(\"Enter person's name: \");\r\n                fgets(name, NAME_LENGTH, stdin);\r\n                name[strcspn(name, \"\\n\")] = 0;\r\n                if (findPerson(name)) \r\n                {\r\n                    printf(\" Person already exists!\\n\");\r\n                }\r\n                 else \r\n                {\r\n                    createPerson(name);         \r\n                    printf(\" Person added.\\n\");\r\n                }\r\n                break;\r\n\r\n            case 2:\r\n                printf(\"Enter child's name: \");\r\n                fgets(name, NAME_LENGTH, stdin);\r\n                name[strcspn(name, \"\\n\")] = 0;\r\n\r\n                printf(\"Enter father's name: \");\r\n                fgets(father, NAME_LENGTH, stdin);\r\n                father[strcspn(father, \"\\n\")] = 0;\r\n\r\n                printf(\"Enter mother's name: \");\r\n                fgets(mother, NAME_LENGTH, stdin);\r\n                mother[strcspn(mother, \"\\n\")] = 0;\r\n\r\n                setParents(name, father, mother);\r\n                break;\r\n\r\n            case 3:\r\n                displayFamilyTree();\r\n                break;\r\n\r\n            case 4:\r\n                printf(\"Enter name to search: \");\r\n                fgets(name, NAME_LENGTH, stdin);\r\n                name[strcspn(name, \"\\n\")] = 0;\r\n                if (findPerson(name)) {\r\n                    printf(\" %s found in the tree.\\n\", name);\r\n                } else {\r\n                    printf(\" Person not found.\\n\");\r\n                }\r\n                break;\r\n\r\n            case 5:\r\n                printf(\"Enter name to show ancestors: \");\r\n                fgets(name, NAME_LENGTH, stdin);\r\n                name[strcspn(name, \"\\n\")] = 0;\r\n                showAncestors(findPerson(name));\r\n                break;\r\n\r\n            case 6:\r\n                printf(\" Exiting...\\n\");\r\n                break;\r\n\r\n            default:\r\n                printf(\" Invalid choice.\\n\");\r\n        }\r\n\r\n    } while (choice != 6);\r\n}\r\n\r\nint main() \r\n{\r\n    SetConsoleOutputCP(CP_UTF8);\r\n    menu();\r\n    return 0;\r\n}<\/pre>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Program 1 \/\/Project: Family Tree Builder (Based on BT) \/* Objective: To create a basic system that allows users to build, manage, and explore a family tree structure, where each person can have parent-child&#46;&#46;&#46;<\/p>\n","protected":false},"author":581,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[24020],"tags":[24331,34844,34880,34874,34875,34876,32249,34816,34883,34881,34870,34882],"class_list":["post-145794","post","type-post","status-publish","format-standard","hentry","category-data-structure-tutorials","tag-data-structures","tag-dsa","tag-dsa-family-tree-builder-project","tag-dsa-practical","tag-dsa-program","tag-dsa-project","tag-dsa-using-c","tag-family-tree-builder","tag-family-tree-builder-in-data-structures","tag-family-tree-builder-in-dsa","tag-family-tree-builder-project","tag-family-tree-builder-using-dsa"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.4 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>DSA Project - Family Tree Builder - DataFlair<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-data-structures\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"DSA Project - Family Tree Builder - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Program 1 \/\/Project: Family Tree Builder (Based on BT) \/* Objective: To create a basic system that allows users to build, manage, and explore a family tree structure, where each person can have parent-child&#046;&#046;&#046;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-data-structures\/\" \/>\n<meta property=\"og:site_name\" content=\"DataFlair\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/DataFlairWS\/\" \/>\n<meta property=\"article:published_time\" content=\"2025-07-11T09:21:09+00:00\" \/>\n<meta name=\"author\" content=\"DataFlair Team\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:site\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"DataFlair Team\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"DSA Project - Family Tree Builder - DataFlair","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-data-structures\/","og_locale":"en_US","og_type":"article","og_title":"DSA Project - Family Tree Builder - DataFlair","og_description":"Program 1 \/\/Project: Family Tree Builder (Based on BT) \/* Objective: To create a basic system that allows users to build, manage, and explore a family tree structure, where each person can have parent-child&#46;&#46;&#46;","og_url":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-data-structures\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2025-07-11T09:21:09+00:00","author":"DataFlair Team","twitter_card":"summary_large_image","twitter_creator":"@DataFlairWS","twitter_site":"@DataFlairWS","twitter_misc":{"Written by":"DataFlair Team","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-data-structures\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-data-structures\/"},"author":{"name":"DataFlair Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/c187795dc82ab948373cca526df7c445"},"headline":"DSA Project &#8211; Family Tree Builder","datePublished":"2025-07-11T09:21:09+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-data-structures\/"},"wordCount":8,"commentCount":0,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"keywords":["Data Structures","dsa","dsa family tree builder project","dsa practical","dsa program","dsa project","dsa using c++","family tree builder","family tree builder in data structures","family tree builder in dsa","family tree builder project","family tree builder using dsa"],"articleSection":["Data Structure Tutorials"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/data-flair.training\/blogs\/family-tree-builder-in-data-structures\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-data-structures\/","url":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-data-structures\/","name":"DSA Project - Family Tree Builder - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"datePublished":"2025-07-11T09:21:09+00:00","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-data-structures\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/family-tree-builder-in-data-structures\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-data-structures\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Blog Home","item":"https:\/\/data-flair.training\/blogs\/"},{"@type":"ListItem","position":2,"name":"Data Structure Tutorials","item":"https:\/\/data-flair.training\/blogs\/category\/data-structure-tutorials\/"},{"@type":"ListItem","position":3,"name":"DSA Project &#8211; Family Tree Builder"}]},{"@type":"WebSite","@id":"https:\/\/data-flair.training\/blogs\/#website","url":"https:\/\/data-flair.training\/blogs\/","name":"DataFlair","description":"Learn Today. Lead Tomorrow.","publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/data-flair.training\/blogs\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/data-flair.training\/blogs\/#organization","name":"DataFlair","url":"https:\/\/data-flair.training\/blogs\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/","url":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","contentUrl":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","width":106,"height":48,"caption":"DataFlair"},"image":{"@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/DataFlairWS\/","https:\/\/x.com\/DataFlairWS","https:\/\/www.linkedin.com\/company\/dataflair-web-services-pvt-ltd\/","https:\/\/www.youtube.com\/user\/DataFlairWS"]},{"@type":"Person","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/c187795dc82ab948373cca526df7c445","name":"DataFlair Team","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/2302ebc438084d2f1f993edc1996a0aae01332e81f3227cba8df0c48ec010ca4?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/2302ebc438084d2f1f993edc1996a0aae01332e81f3227cba8df0c48ec010ca4?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/2302ebc438084d2f1f993edc1996a0aae01332e81f3227cba8df0c48ec010ca4?s=96&d=mm&r=g","caption":"DataFlair Team"},"description":"DataFlair Team provides high-impact content on programming, Java, Python, C++, DSA, AI, ML, data Science, Android, Flutter, MERN, Web Development, and technology. We make complex concepts easy to grasp, helping learners of all levels succeed in their tech careers.","url":"https:\/\/data-flair.training\/blogs\/author\/dfteam6\/"}]}},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/145794","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/users\/581"}],"replies":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/comments?post=145794"}],"version-history":[{"count":2,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/145794\/revisions"}],"predecessor-version":[{"id":145809,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/145794\/revisions\/145809"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=145794"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=145794"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=145794"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}