{"id":8597,"date":"2022-06-23T05:33:20","date_gmt":"2022-06-23T05:33:20","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=8597"},"modified":"2022-12-14T10:31:50","modified_gmt":"2022-12-14T10:31:50","slug":"overview-of-data-structures-binary-tree-bst-heap-and-hash","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/","title":{"rendered":"Overview of data structures binary tree, bst, heap, and hash"},"content":{"rendered":"<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655960971072-Article.jpg\" alt=\"\" \/><\/p>\n<h3>Binary Tree:<\/h3>\n<p>A Binary tree is a tree data structure in which each node has at most two children i.e. the left child and right child.\n<\/p>\n<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1656416497410-Image-01.png\" alt=\"\" \/><\/p>\n<p><strong>Representation:<\/strong> A binary tree is represented by a pointer to the topmost node i.e. root node or parent node and if the tree is empty, then the value of the root node is NULL.<\/p>\n<p><strong>Parts of the Binary tree:<\/strong><\/p>\n<ul>\n<li>Data<\/li>\n<li>Pointer to the left child<\/li>\n<li>Pointer to the right child<\/li>\n<\/ul>\n<p><strong>Traversal of a Binary Tree:<\/strong><\/p>\n<ul>\n<li>\n<p>Depth-first traversal:<\/p>\n<ul>\n<li>Inorder Traversal (Left-Root-Right)<\/li>\n<li>Preorder Traversal (Root-Left-Right)<\/li>\n<li>Postorder Traversal (Left-Right-Root)<\/li>\n<\/ul>\n<\/li>\n<li>\n<p>Breadth-first traversal:<\/p>\n<ul>\n<li>Level order traversal<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p><strong>Basic Operations on Binary Tree:<\/strong><\/p>\n<ul>\n<li>Inserting an element<\/li>\n<li>Removing an element<\/li>\n<li>Searching an element<\/li>\n<li>Traversing an element<\/li>\n<\/ul>\n<p><strong>Binary Tree Traversals:<\/strong><\/p>\n<ul>\n<li><strong>Inorder Traversal:<\/strong> Left-Root-Right i.e. The left node is traversed first then the root node and then the Right node.<\/li>\n<li><strong>Preorder Traversal:<\/strong> Root-Left-Right i.e. The Root node is traversed first then the left node and then the right node.<\/li>\n<li><strong>Postorder Traversal:<\/strong> Left-Right-Root i.e. The Left node is traversed first then the right node and then the Root node.<\/li>\n<\/ul>\n<h3>Binary Search Tree(BST):<\/h3>\n<p>A Binary Tree is a tree-based data structure with the following properties:<\/p>\n<ul>\n<li>The Left subtree of a tree only contains the nodes which are lesser than the root node.<\/li>\n<li>The right subtree of a tree only contains the nodes which are greater than the root node.<\/li>\n<li>And the same for the left and right subtree.<\/li>\n<\/ul>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655960987794-Image-01%20%281%29.png\" alt=\"\" \/><\/p>\n<p><strong>Basic Operations on Binary  Search Tree:<\/strong><\/p>\n<ul>\n<li>Inserting an element<\/li>\n<li>Removing an element<\/li>\n<li>Searching an element<\/li>\n<li>Traversing an element<\/li>\n<\/ul>\n<p><strong>Binary Search Tree Declaration \/ Syntax:<\/strong><\/p>\n<p><code>struct BinarySearchTree{<\/code><br \/>\n<code>int data;<\/code><br \/>\n<code>struct BinarySearchTree&lt;em&gt; left;<\/code><br \/>\n<code>struct BinarySearchTree&lt;\/em&gt; right;<\/code><br \/>\n<code>};<\/code><\/p>\n<h3>Binary Heap:<\/h3>\n<p>A Binary Heap is a complete binary tree that follows a heap ordering property. The representation is done as:<\/p>\n<p><strong><em>Parent Node:<\/em><\/strong> (i-1)\/2<br \/>\n<BR><strong><em>Left Child:<\/em><\/strong> (2<em>i) + 1<br \/>\n<BR><strong><em>Right Child:<\/em><\/strong> (2<\/em>i) + 2<\/p>\n<p><BR>The above table shows the indexes of the ith node.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1656416562944-Image-03.png\" alt=\"\" \/><\/p>\n<h3>Hashing:<\/h3>\n<p>Hashing is a technique that is used for storing and retrieving data in a faster manner. The most popular use of hashing is the implementation of a hash table.<br \/>\nA hash table stores a key and a value pair in a list which is accessible through its index.<br \/>\nA Hash function generates the new value according to a mathematical hashing algorithm known as a hash.<\/p>\n<p>Hash tables support operations like:<\/p>\n<ul>\n<li>Insert<\/li>\n<li>Get<\/li>\n<li>Delete<\/li>\n<\/ul>\n<p>This article tried to discuss the concept of  <strong>binary tree, bst, heap, and hash<\/strong>. Hope this blog helps you understand the concept. To practice problems on Heap you can check out <a href=\"https:\/\/www.prepbytes.com\/prepbytes-courses\/data-structures-algorithms-course\">Data Structures and Algorithms<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Binary Tree: A Binary tree is a tree data structure in which each node has at most two children i.e. the left child and right child. Representation: A binary tree is represented by a pointer to the topmost node i.e. root node or parent node and if the tree is empty, then the value of [&hellip;]<\/p>\n","protected":false},"author":52,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[153],"tags":[177,178,183,175],"class_list":["post-8597","post","type-post","status-publish","format-standard","hentry","category-tree","tag-binary-search-tree","tag-bst","tag-data-structure","tag-heap"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v25.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Overview of data structures binary tree, bst, heap, and hash | Prepbytes<\/title>\n<meta name=\"description\" content=\"Discussing the data structure such as Binary tree, BST, Heap, and Hashing.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Overview of data structures binary tree, bst, heap, and hash | Prepbytes\" \/>\n<meta property=\"og:description\" content=\"Discussing the data structure such as Binary tree, BST, Heap, and Hashing.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/\" \/>\n<meta property=\"og:site_name\" content=\"PrepBytes Blog\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prepbytes0211\/\" \/>\n<meta property=\"article:published_time\" content=\"2022-06-23T05:33:20+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2022-12-14T10:31:50+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655960971072-Article.jpg\" \/>\n<meta name=\"author\" content=\"Prepbytes\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Prepbytes\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/\"},\"author\":{\"name\":\"Prepbytes\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\"},\"headline\":\"Overview of data structures binary tree, bst, heap, and hash\",\"datePublished\":\"2022-06-23T05:33:20+00:00\",\"dateModified\":\"2022-12-14T10:31:50+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/\"},\"wordCount\":420,\"commentCount\":0,\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655960971072-Article.jpg\",\"keywords\":[\"binary search tree\",\"bst\",\"data structure\",\"heap\"],\"articleSection\":[\"Trees\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/\",\"url\":\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/\",\"name\":\"Overview of data structures binary tree, bst, heap, and hash | Prepbytes\",\"isPartOf\":{\"@id\":\"http:\/\/43.205.93.38\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655960971072-Article.jpg\",\"datePublished\":\"2022-06-23T05:33:20+00:00\",\"dateModified\":\"2022-12-14T10:31:50+00:00\",\"description\":\"Discussing the data structure such as Binary tree, BST, Heap, and Hashing.\",\"breadcrumb\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#primaryimage\",\"url\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655960971072-Article.jpg\",\"contentUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655960971072-Article.jpg\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"http:\/\/43.205.93.38\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Trees\",\"item\":\"https:\/\/prepbytes.com\/blog\/category\/tree\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Overview of data structures binary tree, bst, heap, and hash\"}]},{\"@type\":\"WebSite\",\"@id\":\"http:\/\/43.205.93.38\/#website\",\"url\":\"http:\/\/43.205.93.38\/\",\"name\":\"PrepBytes Blog\",\"description\":\"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING\",\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"http:\/\/43.205.93.38\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"http:\/\/43.205.93.38\/#organization\",\"name\":\"Prepbytes\",\"url\":\"http:\/\/43.205.93.38\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"contentUrl\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"width\":160,\"height\":160,\"caption\":\"Prepbytes\"},\"image\":{\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/prepbytes0211\/\",\"https:\/\/www.instagram.com\/prepbytes\/\",\"https:\/\/www.linkedin.com\/company\/prepbytes\/\",\"https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA\"]},{\"@type\":\"Person\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\",\"name\":\"Prepbytes\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g\",\"caption\":\"Prepbytes\"},\"url\":\"https:\/\/prepbytes.com\/blog\/author\/gourav-jaincollegedekho-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Overview of data structures binary tree, bst, heap, and hash | Prepbytes","description":"Discussing the data structure such as Binary tree, BST, Heap, and Hashing.","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:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/","og_locale":"en_US","og_type":"article","og_title":"Overview of data structures binary tree, bst, heap, and hash | Prepbytes","og_description":"Discussing the data structure such as Binary tree, BST, Heap, and Hashing.","og_url":"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/","og_site_name":"PrepBytes Blog","article_publisher":"https:\/\/www.facebook.com\/prepbytes0211\/","article_published_time":"2022-06-23T05:33:20+00:00","article_modified_time":"2022-12-14T10:31:50+00:00","og_image":[{"url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655960971072-Article.jpg","type":"","width":"","height":""}],"author":"Prepbytes","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Prepbytes","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#article","isPartOf":{"@id":"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/"},"author":{"name":"Prepbytes","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e"},"headline":"Overview of data structures binary tree, bst, heap, and hash","datePublished":"2022-06-23T05:33:20+00:00","dateModified":"2022-12-14T10:31:50+00:00","mainEntityOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/"},"wordCount":420,"commentCount":0,"publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655960971072-Article.jpg","keywords":["binary search tree","bst","data structure","heap"],"articleSection":["Trees"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/","url":"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/","name":"Overview of data structures binary tree, bst, heap, and hash | Prepbytes","isPartOf":{"@id":"http:\/\/43.205.93.38\/#website"},"primaryImageOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#primaryimage"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655960971072-Article.jpg","datePublished":"2022-06-23T05:33:20+00:00","dateModified":"2022-12-14T10:31:50+00:00","description":"Discussing the data structure such as Binary tree, BST, Heap, and Hashing.","breadcrumb":{"@id":"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#primaryimage","url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655960971072-Article.jpg","contentUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655960971072-Article.jpg"},{"@type":"BreadcrumbList","@id":"https:\/\/prepbytes.com\/blog\/overview-of-data-structures-binary-tree-bst-heap-and-hash\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"http:\/\/43.205.93.38\/"},{"@type":"ListItem","position":2,"name":"Trees","item":"https:\/\/prepbytes.com\/blog\/category\/tree\/"},{"@type":"ListItem","position":3,"name":"Overview of data structures binary tree, bst, heap, and hash"}]},{"@type":"WebSite","@id":"http:\/\/43.205.93.38\/#website","url":"http:\/\/43.205.93.38\/","name":"PrepBytes Blog","description":"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING","publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"http:\/\/43.205.93.38\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"http:\/\/43.205.93.38\/#organization","name":"Prepbytes","url":"http:\/\/43.205.93.38\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/","url":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","contentUrl":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","width":160,"height":160,"caption":"Prepbytes"},"image":{"@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/prepbytes0211\/","https:\/\/www.instagram.com\/prepbytes\/","https:\/\/www.linkedin.com\/company\/prepbytes\/","https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA"]},{"@type":"Person","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e","name":"Prepbytes","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g","caption":"Prepbytes"},"url":"https:\/\/prepbytes.com\/blog\/author\/gourav-jaincollegedekho-com\/"}]}},"_links":{"self":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/8597","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/users\/52"}],"replies":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/comments?post=8597"}],"version-history":[{"count":6,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/8597\/revisions"}],"predecessor-version":[{"id":8829,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/8597\/revisions\/8829"}],"wp:attachment":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/media?parent=8597"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/categories?post=8597"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/tags?post=8597"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}