<\/span><\/h3>\n\n\n\nA parent node in tree is a node which has one or more child nodes. Example: In the diagram Node A is the parent node of Node B and Node C.<\/p>\n\n\n\n
Leaf Node : <\/strong>Leaf nodes in a tree have no child nodes. Example : Node B, Node C, Node D serve as a leaf node in the given diagram.<\/p>\n\n\n\nHeight : <\/strong>Height of a tree can be calculated as the longest path from that node to the leaf node.<\/p>\n\n\n\nHeight of a tree = Height of a root node.<\/p>\n\n\n\n
Depth of a tree : <\/strong>Depth of a tree can be calculated as the number of edges between the root node to the respective node.<\/p>\n\n\n\nLevel of a tree : <\/strong>Level of a tree in a data structure can be calculated as the number of connections formed between the root node and the respective node.<\/p>\n\n\n\nExample : Root Node == Level 0 (root node of a tree is at level 0) <\/p>\n\n\n\n
Generations : <\/strong>All the nodes of the same level are considered to be the same generation nodes.<\/p>\n\n\n\nExample<\/strong> : Node A ,Node D == Level 1<\/strong><\/p>\n\n\n\n Node B, Node C== Level 2 <\/strong><\/p>\n\n\n\n
1.1<\/strong> TREE IN DATA STRUCTURE<\/strong><\/figcaption><\/figure><\/div>\n\n\nDegree of a node : <\/strong>Degree of a tree can be calculated as the total number of children count of that node.<\/p>\n\n\n\nDegree of a node = <\/strong>Total number of children of a node<\/p>\n\n\n\n<\/span>What is Tree Traversal?<\/strong><\/span><\/h2>\n\n\n\nTree traversal is the process of visiting every node in a tree structure in a specific order. A tree is a type of data structure that looks like a family tree or a chart, where each node can have children. But how do we visit all the nodes without missing anyone or repeating them. That\u2019s where tree traversal algorithms come in. <\/p>\n\n\n\n
They guide us on how to move through the tree, one node at a time. There are four main types which includes pre order traversal, post order traversal, inorder traversal, and level order traversal. Each method follows a different path and is useful for different tasks, like printing, copying, or deleting a tree. Choosing the right traversal helps solve problems easily.<\/p>\n\n\n\n
<\/span>Pre Order Traversal Algorithm<\/strong><\/span><\/h2>\n\n\n\nIn pre order traversal, we follow a specific order that is visiting the root node first, then move to the left child, and finally go to the right child. So the pattern is: Root \u2192 Left \u2192 Right. <\/p>\n\n\n\n
Imagine you are meeting your own family. You talk to the parent first, then the left child, and then the right child. This approach helps when you want to copy a tree because it starts with the main part first. In coding it is useful when you need to deal with parent nodes before working on the children. This traversal works well in many situations where early access to the root node is important. Even though it is simple where pre order traversal plays a big role in many tree-based algorithms.<\/p>\n\n\n
\n
<\/span>Post Order Traversal Algorithm<\/strong><\/span><\/h2>\n\n\n\nPost order traversal follows a different pattern where first you are visiting the left child, then the right child, and last the root node. So the order becomes finally Left \u2192 Right \u2192 Root. <\/p>\n\n\n\n
Think of it like solving the smaller problems before dealing with the bigger one. This method is useful when you need to delete a tree. You remove the children first and then remove the parent which keeps things clean and avoids errors. It is also used in some mathematical expression trees where you calculate the values at the bottom first. Even though post order traversal seems like you are saving the main part for the end that helps a lot when the final result depends on all smaller parts being handled first.<\/p>\n\n\n\n
<\/span>Inorder Traversal Algorithm<\/strong><\/span><\/h2>\n\n\n\nInorder traversal goes in this sequence like the way we are representing here Left \u2192 Root \u2192 Right. You should first visiting the left child, then the root node, and then the right child. This type of traversal is very important when working with Binary Search Trees. Because it gives you the nodes in sorted order. <\/p>\n\n\n\n
So if your tree holds numbers or words, an inorder traversal will show them in order from smallest to largest. This makes it perfect for printing sorted data or checking the structure of the tree. It is also helpful when you want to look at data in a balanced way. Even though it sounds basic, inorder traversal is often the most-used technique in many tree-based operations.<\/p>\n\n\n\n
<\/span>Time Complexity of Tree Traversal Algorithms<\/strong><\/span><\/h2>\n\n\n\nUnderstanding the time complexity of tree traversal algorithms is important for analyzing the efficiency of operation on a tree data structure. No matter which tree traversal method we are using whether it is pre order traversal, Inorder traversal, post order traversal, or level order traversal in which every node in the tree is usually visited one time. This means the time it takes depends mostly on how many nodes the tree has. In this section, we will look at how long each method takes so you can understand how fast they work in different situations.<\/p>\n\n\n\nTraversal Type<\/td> Time Complexity<\/td> Explanation<\/td><\/tr> Pre-order Traversal<\/td> O(n)<\/td> Each node is visited once (Root \u2192 Left \u2192 Right)<\/td><\/tr> In-order Traversal<\/td> O(n)<\/td> Each node is visited once (Left \u2192 Root \u2192 Right)<\/td><\/tr> Post-order Traversal<\/td> O(n)<\/td> Each node is visited once (Left \u2192 Right \u2192 Root)<\/td><\/tr> Level-order Traversal (BFS)<\/td> O(n)<\/td> Each node is visited once using a queue (Breadth-First Search)<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<\/span>Comparison Between Pre Order and Post Order Traversal<\/strong><\/span><\/h2>\n\n\n\nIn this section we will talk about the comparison between pre order traversal and post order traversal algorithm. We will understand multiple features in the tabular format. <\/p>\n\n\n\nAspect<\/strong><\/td>Pre-order Traversal<\/strong><\/td>Post-order Traversal<\/strong><\/td><\/tr>Order of Traversal<\/td> Root \u2192 Left Subtree \u2192 Right Subtree<\/td> Left Subtree \u2192 Right Subtree \u2192 Root<\/td><\/tr> Visit Time of Root Node<\/td> First<\/td> Last<\/td><\/tr> Use Case<\/td> Used to create a copy of the tree<\/td> Used to delete or free nodes in a tree<\/td><\/tr> Expression Evaluation<\/td> Used to get prefix expression from an expression tree<\/td> Used to get postfix expression from an expression tree<\/td><\/tr> Recursive Algorithm Pattern<\/td> Process root, then recursively traverse left and right<\/td> Recursively traverse left and right, then process root<\/td><\/tr> Example (for tree 1-2-3)<\/td> Pre-order: 1 \u2192 2 \u2192 3<\/td> Post-order: 2 \u2192 3 \u2192 1<\/td><\/tr> Stack Implementation Order<\/td> Push right, then left (so left is processed first)<\/td> Push root last (after left and right children)<\/td><\/tr> Memory Usage<\/td> Similar, but can vary based on recursion depth<\/td> Similar, but can vary based on recursion depth<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<\/span>Frequently Asked Questions<\/strong><\/span><\/h2>\n\n\n\n<\/span>What are tree traversal algorithms?<\/strong><\/span><\/h3>\n\n\n\nTree traversal algorithms help you visit each node in a tree structure exactly once. These methods include pre order traversal, post order traversal, inorder traversal, and level order traversal. Since each follows a specific visiting pattern, they solve different problems like expression evaluation, data searching, or hierarchical processing.<\/p>\n\n\n\n
<\/span>Why do tree traversal algorithms matter in computer science?<\/strong><\/span><\/h3>\n\n\n\nThese algorithms play a key role in solving problems that involve hierarchical or tree-like data. Developers use them in various fields such as compilers, databases, and artificial intelligence. Tree traversal algorithms help simplify tasks like searching, analyzing, and modifying tree-based data structures.<\/p>\n\n\n\n
<\/span>What is the difference between pre order traversal and post order traversal?<\/strong><\/span><\/h3>\n\n\n\nIn pre order traversal, you visit the root node first, then the left subtree, and finally the right subtree. On the other hand, post order traversal visits the left subtree first, then the right one, and the root comes last. This order matters depending on whether you need to process a parent node before or after its children.<\/p>\n\n\n\n
<\/span>When should you use inorder traversal?<\/strong><\/span><\/h3>\n\n\n\nUse inorder traversal when you want nodes in sorted order, especially in binary search trees. It visits nodes in the order of left, root, and right, which gives a sorted result. This makes it a great choice for tasks like sorting or printing tree elements in increasing order.<\/p>\n\n\n\n
<\/span>How does level order traversal stand out?<\/strong><\/span><\/h3>\n\n\n\nUnlike the other depth-first traversal methods, level order traversal follows a breadth-first approach. It uses a queue to visit all nodes level by level, from top to bottom and left to right. Because of this pattern, it\u2019s ideal for printing each level or finding the shortest path in an unweighted tree.<\/p>\n\n\n\n
<\/span>Which traversal method works best for copying a tree?<\/strong><\/span><\/h3>\n\n\n\nPre order traversal is the most useful when you need to copy a tree. Since it starts from the root and visits each node in order, it helps maintain the parent-child structure in the new tree.<\/p>\n\n\n\n
<\/span>Can you perform tree traversal without recursion?<\/strong><\/span><\/h3>\n\n\n\nYes, you can use iterative methods with stacks or queues instead of recursion. In fact, all common tree traversal algorithms\u2014like inorder, pre order, and post order that can be written without recursive calls. This approach is helpful when you want more control over memory usage.<\/p>\n\n\n\n
<\/span>Do all tree traversal algorithms have the same time complexity?<\/strong><\/span><\/h3>\n\n\n\nYes, they do. Every node gets visited once, so the time complexity for inorder traversal, pre order traversal, post order traversal, and level order traversal is O(n), where n is the total number of nodes.<\/p>\n\n\n\n
<\/span>Where do we use tree traversal algorithms in real life?<\/strong><\/span><\/h3>\n\n\n\nYou can find tree traversal algorithms in many real-world applications. For example, compilers use them for syntax tree analysis, databases for query plans, AI for decision trees, and file systems for folder navigation. Each method offers a different way to read or modify tree data based on the task.<\/p>\n\n\n\n
<\/span>Can we use these algorithms for N-ary trees?<\/strong><\/span><\/h3>\n\n\n\nYes, you can apply them to N-ary trees as well. Although these trees have more than two children per node, the main idea of traversal remains the same. You only need to adjust your loop or recursive function to handle more children.<\/p>\n","protected":false},"excerpt":{"rendered":"
Tree data structure is an important data structure to maintain hierarchical computation in the system. To maintain complex data systems we are using tree data structure by following different terms that involves nodes, height, depth as well as generation of a tree in data structures. In this blog we will talk about tree traversal algorithms […]<\/p>\n","protected":false},"author":560,"featured_media":53300,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1075,1073],"tags":[],"yoast_head":"\n
4 Different Types of Tree Traversal Algorithms - iQuanta<\/title>\n<meta name=\"description\" content=\"In this blog we will talk about tree traversal algorithms along with recapping the old ones. Tree traversal algorithms include pre order ..\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"4 Different Types of Tree Traversal Algorithms\" \/>\n<meta property=\"og:description\" content=\"In this blog we will talk about tree traversal algorithms along with recapping the old ones. Tree traversal algorithms include pre order ..\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/\" \/>\n<meta property=\"og:site_name\" content=\"iQuanta\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/facebook.com\/iquanta.in\" \/>\n<meta property=\"article:published_time\" content=\"2025-07-04T11:37:24+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-07-04T11:44:25+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/07\/WhatsApp-Image-2025-07-04-at-5.03.42-PM.jpeg\" \/>\n\t<meta property=\"og:image:width\" content=\"1600\" \/>\n\t<meta property=\"og:image:height\" content=\"900\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"author\" content=\"Nidhi Goswami\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Nidhi Goswami\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"10 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/\"},\"author\":{\"name\":\"Nidhi Goswami\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/ec8c8c25d0526dd86557b6fed064f7f3\"},\"headline\":\"4 Different Types of Tree Traversal Algorithms\",\"datePublished\":\"2025-07-04T11:37:24+00:00\",\"dateModified\":\"2025-07-04T11:44:25+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/\"},\"wordCount\":1952,\"publisher\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/#organization\"},\"articleSection\":[\"DSA and Competitive Programming\",\"iSkills\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/\",\"url\":\"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/\",\"name\":\"4 Different Types of Tree Traversal Algorithms - iQuanta\",\"isPartOf\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/#website\"},\"datePublished\":\"2025-07-04T11:37:24+00:00\",\"dateModified\":\"2025-07-04T11:44:25+00:00\",\"description\":\"In this blog we will talk about tree traversal algorithms along with recapping the old ones. Tree traversal algorithms include pre order ..\",\"breadcrumb\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/www.iquanta.in\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"4 Different Types of Tree Traversal Algorithms\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#website\",\"url\":\"https:\/\/www.iquanta.in\/blog\/\",\"name\":\"iQuanta | Cat Preparation Online\",\"description\":\"Building Learning Networks\",\"publisher\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.iquanta.in\/blog\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#organization\",\"name\":\"IQuanta\",\"url\":\"https:\/\/www.iquanta.in\/blog\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2018\/08\/IQuanta-1.png\",\"contentUrl\":\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2018\/08\/IQuanta-1.png\",\"width\":525,\"height\":200,\"caption\":\"IQuanta\"},\"image\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/facebook.com\/iquanta.in\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/ec8c8c25d0526dd86557b6fed064f7f3\",\"name\":\"Nidhi Goswami\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/21d234d87afd924b217d26b25a3cf1ee?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/21d234d87afd924b217d26b25a3cf1ee?s=96&d=mm&r=g\",\"caption\":\"Nidhi Goswami\"},\"url\":\"https:\/\/www.iquanta.in\/blog\/author\/nidhigoswami\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"4 Different Types of Tree Traversal Algorithms - iQuanta","description":"In this blog we will talk about tree traversal algorithms along with recapping the old ones. Tree traversal algorithms include pre order ..","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:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/","og_locale":"en_US","og_type":"article","og_title":"4 Different Types of Tree Traversal Algorithms","og_description":"In this blog we will talk about tree traversal algorithms along with recapping the old ones. Tree traversal algorithms include pre order ..","og_url":"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/","og_site_name":"iQuanta","article_publisher":"https:\/\/facebook.com\/iquanta.in","article_published_time":"2025-07-04T11:37:24+00:00","article_modified_time":"2025-07-04T11:44:25+00:00","og_image":[{"width":1600,"height":900,"url":"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/07\/WhatsApp-Image-2025-07-04-at-5.03.42-PM.jpeg","type":"image\/jpeg"}],"author":"Nidhi Goswami","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Nidhi Goswami","Est. reading time":"10 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/#article","isPartOf":{"@id":"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/"},"author":{"name":"Nidhi Goswami","@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/ec8c8c25d0526dd86557b6fed064f7f3"},"headline":"4 Different Types of Tree Traversal Algorithms","datePublished":"2025-07-04T11:37:24+00:00","dateModified":"2025-07-04T11:44:25+00:00","mainEntityOfPage":{"@id":"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/"},"wordCount":1952,"publisher":{"@id":"https:\/\/www.iquanta.in\/blog\/#organization"},"articleSection":["DSA and Competitive Programming","iSkills"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/","url":"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/","name":"4 Different Types of Tree Traversal Algorithms - iQuanta","isPartOf":{"@id":"https:\/\/www.iquanta.in\/blog\/#website"},"datePublished":"2025-07-04T11:37:24+00:00","dateModified":"2025-07-04T11:44:25+00:00","description":"In this blog we will talk about tree traversal algorithms along with recapping the old ones. Tree traversal algorithms include pre order ..","breadcrumb":{"@id":"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.iquanta.in\/blog\/4-different-types-of-tree-traversal-algorithms\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.iquanta.in\/blog\/"},{"@type":"ListItem","position":2,"name":"4 Different Types of Tree Traversal Algorithms"}]},{"@type":"WebSite","@id":"https:\/\/www.iquanta.in\/blog\/#website","url":"https:\/\/www.iquanta.in\/blog\/","name":"iQuanta | Cat Preparation Online","description":"Building Learning Networks","publisher":{"@id":"https:\/\/www.iquanta.in\/blog\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.iquanta.in\/blog\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/www.iquanta.in\/blog\/#organization","name":"IQuanta","url":"https:\/\/www.iquanta.in\/blog\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2018\/08\/IQuanta-1.png","contentUrl":"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2018\/08\/IQuanta-1.png","width":525,"height":200,"caption":"IQuanta"},"image":{"@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/facebook.com\/iquanta.in"]},{"@type":"Person","@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/ec8c8c25d0526dd86557b6fed064f7f3","name":"Nidhi Goswami","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/21d234d87afd924b217d26b25a3cf1ee?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/21d234d87afd924b217d26b25a3cf1ee?s=96&d=mm&r=g","caption":"Nidhi Goswami"},"url":"https:\/\/www.iquanta.in\/blog\/author\/nidhigoswami\/"}]}},"_links":{"self":[{"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/posts\/53256"}],"collection":[{"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/users\/560"}],"replies":[{"embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/comments?post=53256"}],"version-history":[{"count":11,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/posts\/53256\/revisions"}],"predecessor-version":[{"id":56188,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/posts\/53256\/revisions\/56188"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/media\/53300"}],"wp:attachment":[{"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/media?parent=53256"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/categories?post=53256"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/tags?post=53256"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}