{"id":76149,"date":"2024-07-19T10:54:45","date_gmt":"2024-07-19T14:54:45","guid":{"rendered":"https:\/\/bangla.sitestree.com\/?p=76149"},"modified":"2024-07-28T17:02:54","modified_gmt":"2024-07-28T21:02:54","slug":"from-pre-order-tree-traversal-output-to-build-the-tree","status":"publish","type":"post","link":"http:\/\/bangla.sitestree.com\/?p=76149","title":{"rendered":"From Pre-order Tree Traversal Output to Build the Tree"},"content":{"rendered":"\n
<\/figure>
\n

<\/p>\n\n\n\n

\"\"<\/a><\/figure>\n\n\n\n

<\/p>\n<\/div><\/div>\n\n\n\n


From Pre-order Tree Traversal Output to Build the Tree
First one becomes the root such as N
Some immediate ones (D G) also becomes parents up until middle (you can choose) \u2013 left sub tree parens

Then put some immediate ones (K P) as right children (in left subtree) to come to root

Then take alternate (E F L) to have the parents on the right (Goes Right, right subtree)

come back from right, take remaining (A, T), make them left children (bottom to up direction)<\/p>\n","protected":false},"excerpt":{"rendered":"

From Pre-order Tree Traversal Output to Build the TreeFirst one becomes the root such as NSome immediate ones (D G) also becomes parents up until middle (you can choose) \u2013 left sub tree parens Then put some immediate ones (K P) as right children (in left subtree) to come to root Then take alternate (E … <\/p>\n

Continue reading<\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[1966,1883,182],"tags":[],"class_list":["post-76149","post","type-post","status-publish","format-standard","hentry","category-data-structure-and-algorithms","category---data-structure","category---blog","item-wrap"],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack-related-posts":[{"id":76155,"url":"http:\/\/bangla.sitestree.com\/?p=76155","url_meta":{"origin":76149,"position":0},"title":"Input: Tree Traversal Data Output: Build the Tree","author":"Sayed","date":"July 19, 2024","format":false,"excerpt":"Problem: Ref: Book on Data Structure and Algorithm in C \u2022From In-order Output to Build the Tree \u2022Take In-order Traversal Output Data \u2022And Build the Tree \u2022Take the middle (N) or so as the root \u2022Keep going\/taking alternate left (nodeLabels) (K D) from there \u2022Make those also roots\/parents (left sub\u2026","rel":"","context":"In "Data Structure and Algorithms"","block_context":{"text":"Data Structure and Algorithms","link":"http:\/\/bangla.sitestree.com\/?cat=1966"},"img":{"alt_text":"","src":"https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/07\/image-4.png?resize=350%2C200","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/07\/image-4.png?resize=350%2C200 1x, https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/07\/image-4.png?resize=525%2C300 1.5x, https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/07\/image-4.png?resize=700%2C400 2x"},"classes":[]},{"id":76152,"url":"http:\/\/bangla.sitestree.com\/?p=76152","url_meta":{"origin":76149,"position":1},"title":"Input: Post order Tree Traversal data, Output: Tree","author":"Sayed","date":"July 19, 2024","format":false,"excerpt":"\u2022 Last one (E) becomes the root \u2022 Some immediate (backward) right ones ones (L A T) up until middle (you can choose)\u00a0 also becomes parents (downward right side parent) \u2022 \u2013 Then put some immediate ones (backward) ( N F ) as left\u00a0 children to come to rootThen take\u2026","rel":"","context":"In "Data Structure and Algorithms"","block_context":{"text":"Data Structure and Algorithms","link":"http:\/\/bangla.sitestree.com\/?cat=1966"},"img":{"alt_text":"","src":"https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/07\/image-3.png?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/07\/image-3.png?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/07\/image-3.png?resize=525%2C300&ssl=1 1.5x, https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/07\/image-3.png?resize=700%2C400&ssl=1 2x"},"classes":[]},{"id":76144,"url":"http:\/\/bangla.sitestree.com\/?p=76144","url_meta":{"origin":76149,"position":2},"title":"Build the Tree from Tree Traversal Output","author":"Sayed","date":"July 19, 2024","format":false,"excerpt":"From In-order Output to Build the Tree \u2022Take In-order Traversal Output Data \u2022And Build the Tree \u2022Take the middle (N) or so as the root \u2022Keep going\/taking alternate left (nodeLabels) (K D) from there \u2022Make those also roots\/parents (left sub tree) \u2022The last may be at the last left in\u2026","rel":"","context":"In "Data Structure and Algorithms"","block_context":{"text":"Data Structure and Algorithms","link":"http:\/\/bangla.sitestree.com\/?cat=1966"},"img":{"alt_text":"","src":"https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/07\/image-1-1024x101.png?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/07\/image-1-1024x101.png?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/07\/image-1-1024x101.png?resize=525%2C300&ssl=1 1.5x, https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/07\/image-1-1024x101.png?resize=700%2C400&ssl=1 2x"},"classes":[]},{"id":76203,"url":"http:\/\/bangla.sitestree.com\/?p=76203","url_meta":{"origin":76149,"position":3},"title":"Pre Order Traversal of a Binary Tree in C","author":"Sayed","date":"July 28, 2024","format":false,"excerpt":"\/\/ pre order traversalvoid preOrder(NodePtr node) {if (node != NULL) { printf(\"%s \", node->data.word); preOrder(node->left); preOrder(node->right);}}","rel":"","context":"In "Data Structure and Algorithms"","block_context":{"text":"Data Structure and Algorithms","link":"http:\/\/bangla.sitestree.com\/?cat=1966"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":76205,"url":"http:\/\/bangla.sitestree.com\/?p=76205","url_meta":{"origin":76149,"position":4},"title":"Binary Tree Traversal in Post Order: In C","author":"Sayed","date":"July 28, 2024","format":false,"excerpt":"\/\/ traverse the tree in post-order basis \/\/ print the treee content in post-order basis void postOrder(NodePtr node) { if (node != NULL) { postOrder(node->left); postOrder(node->right); printf(\"%s \", node->data.word); } }","rel":"","context":"In "Data Structure and Algorithms"","block_context":{"text":"Data Structure and Algorithms","link":"http:\/\/bangla.sitestree.com\/?cat=1966"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":76207,"url":"http:\/\/bangla.sitestree.com\/?p=76207","url_meta":{"origin":76149,"position":5},"title":"Binary Tree Traversal using In Order: In C","author":"Sayed","date":"July 28, 2024","format":false,"excerpt":"\/\/ traverse the tree in in-order basis \/\/ print the treee content in in-order basis void inOrder(NodePtr node) { if (node != NULL) { inOrder(node->left); printf(\"%s \", node->data.word); inOrder(node->right); } }","rel":"","context":"In "Data Structure and Algorithms"","block_context":{"text":"Data Structure and Algorithms","link":"http:\/\/bangla.sitestree.com\/?cat=1966"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]}],"_links":{"self":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts\/76149","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=76149"}],"version-history":[{"count":1,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts\/76149\/revisions"}],"predecessor-version":[{"id":76151,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts\/76149\/revisions\/76151"}],"wp:attachment":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=76149"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=76149"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=76149"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}