

{"id":146078,"date":"2025-07-23T11:54:39","date_gmt":"2025-07-23T06:24:39","guid":{"rendered":"https:\/\/data-flair.training\/blogs\/?p=146078"},"modified":"2025-07-23T11:54:39","modified_gmt":"2025-07-23T06:24:39","slug":"family-tree-builder-in-dsa-cpp","status":"publish","type":"post","link":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-dsa-cpp\/","title":{"rendered":"DSA C++ 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 and Linked list)\r\n\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(person)\r\n2. Set Parents \r\n2. Display the Entire Family Tree\r\n3.Search for a Member\r\n4.Show Ancestors\r\n5. Exit\r\n*\/\r\n\r\n\r\n#include &lt;iostream&gt;\r\n#include &lt;cstring&gt;\r\n#include &lt;windows.h&gt;\r\nusing namespace std;\r\n\r\nclass Person             \/\/ Node\r\n{\r\npublic:\r\n    char name[50];\r\n    Person* father;\r\n    Person* mother;\r\n    Person* next;\r\n\r\n    Person(const char* pname)\r\n     {\r\n        strcpy(name, pname);\r\n        father = nullptr;\r\n        mother = nullptr;\r\n        next = nullptr;\r\n    }\r\n};\r\n\r\nclass FamilyTree \r\n{\r\nprivate:\r\n    Person* head;\r\n\r\n    Person* findPerson(const char* name)    \/\/ mamta\r\n    {\r\n        Person* temp = head;\r\n        while (temp != nullptr) \r\n        {\r\n            if (strcmp(temp-&gt;name, name) == 0)\r\n                return temp;\r\n            temp = temp-&gt;next;\r\n        }\r\n        return nullptr;\r\n    }\r\n\r\n    void printAncestors(Person* person, int level = 1) \r\n    {\r\n        if (person == nullptr)\r\n            return;\r\n        if (person-&gt;father != nullptr) \r\n        {\r\n            for (int i = 0; i &lt; level; i++) cout &lt;&lt; \"  \";\r\n            cout &lt;&lt; \"Father: \" &lt;&lt; person-&gt;father-&gt;name &lt;&lt; endl;\r\n            printAncestors(person-&gt;father, level + 1);\r\n        }\r\n        if (person-&gt;mother != nullptr) {\r\n            for (int i = 0; i &lt; level; i++) cout &lt;&lt; \"  \";\r\n            cout &lt;&lt; \"Mother: \" &lt;&lt; person-&gt;mother-&gt;name &lt;&lt; endl;\r\n            printAncestors(person-&gt;mother, level + 1);\r\n        }\r\n    }\r\n\r\npublic:\r\n    FamilyTree() \r\n    {\r\n        head = nullptr;\r\n    }\r\n\r\n    void addPerson() \r\n    {\r\n        char name[50];\r\n        cout &lt;&lt; \"Enter person's name: \";\r\n        cin.getline(name, 50);\r\n\r\n        if (findPerson(name) != nullptr)  \r\n        {\r\n            cout &lt;&lt; \"Person already exists.\\n\";\r\n            return;\r\n        }\r\n\r\n        Person* newPerson = new Person(name);\r\n\r\n        if (head == nullptr)\r\n            head = newPerson;\r\n        else \r\n        {\r\n            Person* temp = head;\r\n            while (temp-&gt;next != nullptr)\r\n                temp = temp-&gt;next;\r\n            temp-&gt;next = newPerson;\r\n        }\r\n\r\n        cout &lt;&lt; \"Person added.\\n\";\r\n    }\r\n\r\n    void setParents() \r\n    {\r\n        char childName[50], fatherName[50], motherName[50];\r\n\r\n        cout &lt;&lt; \"Enter child's name: \";\r\n        cin.getline(childName, 50);\r\n\r\n        Person* child = findPerson(childName); \r\n        if (child == nullptr) \r\n        {\r\n            cout &lt;&lt; \"Child not found. Add person first.\\n\";\r\n            return;\r\n        }\r\n\r\n        cout &lt;&lt; \"Enter father's name: \";\r\n        cin.getline(fatherName, 50);\r\n        Person* father = findPerson(fatherName);\r\n        if (father == nullptr) {\r\n            cout &lt;&lt; \"Father not found. Add person first.\\n\";\r\n            return;\r\n        }\r\n\r\n        cout &lt;&lt; \"Enter mother's name: \";\r\n        cin.getline(motherName, 50);\r\n        Person* mother = findPerson(motherName);\r\n        if (mother == nullptr) {\r\n            cout &lt;&lt; \"Mother not found. Add person first.\\n\";\r\n            return;\r\n        }\r\n\r\n        child-&gt;father = father;\r\n        child-&gt;mother = mother;\r\n\r\n        cout &lt;&lt; \"Parents set successfully.\\n\";\r\n    }\r\n\r\n    void displayTree()\r\n     {\r\n        if (head == nullptr) \r\n        {\r\n            cout &lt;&lt; \"No family members found.\\n\";\r\n            return;\r\n        }\r\n\r\n        Person* temp = head;\r\n        while (temp != nullptr) \r\n        {\r\n            cout &lt;&lt; \"\\nName: \" &lt;&lt; temp-&gt;name &lt;&lt; endl;\r\n            if (temp-&gt;father != nullptr)\r\n                cout &lt;&lt; \"    Father: \" &lt;&lt; temp-&gt;father-&gt;name &lt;&lt; endl;\r\n            if (temp-&gt;mother != nullptr)\r\n                cout &lt;&lt; \"    Mother: \" &lt;&lt; temp-&gt;mother-&gt;name &lt;&lt; endl;\r\n            temp = temp-&gt;next;\r\n        }\r\n    }\r\n\r\n    void searchPerson()  \r\n    {\r\n        char name[50];\r\n        cout &lt;&lt; \"Enter name to search: \";\r\n        cin.getline(name, 50);   \/\/mamta\r\n\r\n        Person* found = findPerson(name);\r\n        if (found != nullptr)\r\n            cout &lt;&lt; \" \" &lt;&lt; name &lt;&lt; \" is in the family tree.\\n\";\r\n        else\r\n            cout &lt;&lt; \" \" &lt;&lt; name &lt;&lt; \" not found.\\n\";\r\n    }\r\n\r\n    void showAncestors()\r\n     {\r\n        char name[50];\r\n        cout &lt;&lt; \"Enter name to show ancestors: \";   \/\/shubham\r\n        cin.getline(name, 50);\r\n\r\n        Person* person = findPerson(name);\r\n        if (person == nullptr)\r\n         {\r\n            cout &lt;&lt; \" Person not found.\\n\";\r\n            return;\r\n        }\r\n\r\n        cout &lt;&lt; \"\ud83e\uddec Ancestors of \" &lt;&lt; person-&gt;name &lt;&lt; \":\\n\";\r\n        printAncestors(person);\r\n    }\r\n};\r\n\r\n\/\/ Menu\r\nvoid menu() {\r\n    FamilyTree tree;\r\n    int choice;\r\n\r\n    do {\r\n        cout &lt;&lt; \"\\n=====  Family Tree Builder =====\\n\";\r\n        cout &lt;&lt; \"1. Add Person\\n\";\r\n        cout &lt;&lt; \"2. Set Parents\\n\";\r\n        cout &lt;&lt; \"3. Display Family Tree\\n\";\r\n        cout &lt;&lt; \"4. Search Person\\n\";\r\n        cout &lt;&lt; \"5. Show Ancestors\\n\";\r\n        cout &lt;&lt; \"6. Exit\\n\";\r\n        cout&lt;&lt;\"=============================\\n\";\r\n        cout &lt;&lt; \"Choose an option: \";\r\n        cin &gt;&gt; choice;\r\n        cin.ignore(); \/\/ flush newline\r\n\r\n        switch (choice) {\r\n            case 1:\r\n                tree.addPerson();\r\n                break;\r\n            case 2:\r\n                tree.setParents();\r\n                break;\r\n            case 3:\r\n                tree.displayTree();\r\n                break;\r\n            case 4:\r\n                tree.searchPerson();\r\n                break;\r\n            case 5:\r\n                tree.showAncestors();\r\n                break;\r\n            case 6:\r\n                cout &lt;&lt; \" Exiting. Goodbye!\\n\";\r\n                break;\r\n            default:\r\n                cout &lt;&lt; \" Invalid choice. Try again.\\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 and Linked list) \/* Objective: To create a basic system that allows users to build, manage, and explore a family tree structure, where each&#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":[31449],"tags":[32874,34952,32869,32870,34887,34816,34951,34870,34950],"class_list":["post-146078","post","type-post","status-publish","format-standard","hentry","category-dsa-cpp-tutorials","tag-dsa-c","tag-dsa-c-family-tree-builder-project","tag-dsa-c-practical","tag-dsa-c-program","tag-dsa-c-project","tag-family-tree-builder","tag-family-tree-builder-in-dsa-c","tag-family-tree-builder-project","tag-family-tree-builder-using-dsa-c"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.4 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>DSA C++ 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-dsa-cpp\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"DSA C++ Project - Family Tree Builder - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Program 1 \/\/ Project: Family Tree Builder (Based on BT and Linked list) \/* Objective: To create a basic system that allows users to build, manage, and explore a family tree structure, where each&#046;&#046;&#046;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-dsa-cpp\/\" \/>\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-23T06:24:39+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 C++ 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-dsa-cpp\/","og_locale":"en_US","og_type":"article","og_title":"DSA C++ Project - Family Tree Builder - DataFlair","og_description":"Program 1 \/\/ Project: Family Tree Builder (Based on BT and Linked list) \/* Objective: To create a basic system that allows users to build, manage, and explore a family tree structure, where each&#46;&#46;&#46;","og_url":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-dsa-cpp\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2025-07-23T06:24:39+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-dsa-cpp\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-dsa-cpp\/"},"author":{"name":"DataFlair Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/c187795dc82ab948373cca526df7c445"},"headline":"DSA C++ Project &#8211; Family Tree Builder","datePublished":"2025-07-23T06:24:39+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-dsa-cpp\/"},"wordCount":9,"commentCount":0,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"keywords":["dsa c++","dsa c++ family tree builder project","dsa c++ practical","dsa c++ program","dsa c++ project","family tree builder","family tree builder in dsa c++","family tree builder project","family tree builder using dsa c++"],"articleSection":["DSA using C++ Tutorials"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/data-flair.training\/blogs\/family-tree-builder-in-dsa-cpp\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-dsa-cpp\/","url":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-dsa-cpp\/","name":"DSA C++ Project - Family Tree Builder - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"datePublished":"2025-07-23T06:24:39+00:00","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-dsa-cpp\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/family-tree-builder-in-dsa-cpp\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/family-tree-builder-in-dsa-cpp\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Blog Home","item":"https:\/\/data-flair.training\/blogs\/"},{"@type":"ListItem","position":2,"name":"DSA using C++ Tutorials","item":"https:\/\/data-flair.training\/blogs\/category\/dsa-cpp-tutorials\/"},{"@type":"ListItem","position":3,"name":"DSA C++ 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\/146078","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=146078"}],"version-history":[{"count":2,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/146078\/revisions"}],"predecessor-version":[{"id":146088,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/146078\/revisions\/146088"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=146078"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=146078"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=146078"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}