{"id":570,"date":"2021-02-04T00:59:21","date_gmt":"2021-02-03T19:29:21","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=570"},"modified":"2022-07-01T21:10:48","modified_gmt":"2022-07-01T15:40:48","slug":"program-to-find-the-size-of-a-genric-tree","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/program-to-find-the-size-of-a-genric-tree\/","title":{"rendered":"Program to find the Size,Height and the Maximum in a Generic Tree"},"content":{"rendered":"\n<p>This is a java program to calculate size , height and maximum element in a generic tree. If you don\u2019t know \u201c<strong>What is a generic tree ?<\/strong>\u201d Learn about the basics of Generic Tree and its implementation in java , here.<\/p>\n\n\n\n<figure class=\"wp-block-image size-large\"><img fetchpriority=\"high\" decoding=\"async\" width=\"1167\" height=\"675\" src=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/02\/program-to-find-the-size-of-a-generic-tree-codingbroz.png\" alt=\"Program to find the Size,Height and the Maximum in a Generic Tree\" class=\"wp-image-572\" srcset=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/02\/program-to-find-the-size-of-a-generic-tree-codingbroz.png 1167w, https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/02\/program-to-find-the-size-of-a-generic-tree-codingbroz-768x444.png 768w\" sizes=\"(max-width: 1167px) 100vw, 1167px\" \/><\/figure>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-662f38c6dbd0b\" class=\"ez-toc-cssicon-toggle-label\"><label class=\"ez-toc-title\">Table of Contents<\/label>\n<span class=\"ez-toc-cssicon\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #0090ff;color:#0090ff\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #0090ff;color:#0090ff\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-662f38c6dbd0b\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/program-to-find-the-size-of-a-genric-tree\/#What_is_Size_of_a_generic_tree\" title=\"What is Size of a generic tree ?\">What is Size of a generic tree ?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/program-to-find-the-size-of-a-genric-tree\/#What_is_Height_of_a_generic_tree\" title=\"What is Height of a generic tree ?\">What is Height of a generic tree ?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/program-to-find-the-size-of-a-genric-tree\/#How_To_Find_Maximum_in_a_generic_tree\" title=\"How To Find Maximum in a generic tree ?\">How To Find Maximum in a generic tree ?<\/a><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"What_is_Size_of_a_generic_tree\"><\/span><strong>What is Size of a generic tree ?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Size of a tree is the total number of nodes present in the tree. Take the following example of a generic tree.<\/p>\n\n\n\n<p>Size of this generic tree is 12.<\/p>\n\n\n\n<p>The Basic formula of calculating the Size of a generic tree is given by :<\/p>\n\n\n\n<p>Size(tree) = Size(child subtree 1) + Size(child subtree2) + \u2026\u2026\u2026. + 1(counting itself)<\/p>\n\n\n\n<p>Taking the example of the above tree , formula goes like :<\/p>\n\n\n\n<p>Size(10) = Size(20) + Size(30) + Size(40) + 1 = 3 + 6 + 2 +1 = 12.<\/p>\n\n\n\n<p>Using recursion, our expectation is the function Size(10) = Size(20) + Size(30) + Size(40) + 1.<\/p>\n\n\n\n<p>And our faith is that function Size(40),Size(30),Size(20) knows how to calculate their size. Then we add 1 in the Result, which calculates the size of our generic tree.<\/p>\n\n\n\n<p><strong>ALGORITHM :<\/strong><\/p>\n\n\n\n<ol><li>Declare a size function<\/li><li>Check if the node is null return 0.<\/li><li>Declare an int variable named size<\/li><li>Traverse each child from children arraylist using for loop, and for each child calculate the child size and add it in size.<\/li><li>At last add 1 in the size\u00a0<\/li><li>Return the size<\/li><\/ol>\n\n\n\n<p>Let\u2019s move towards the sum function :<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">public static int size(Node node){\n   \n    if(node==null)return 0;\n    int size = 0;\n    for(Node child : node.children)\n    {\n        int childSize = size(child);\n        size = size + childSize;\n    }\n    return size+1 ;\n\n  }\n<\/pre>\n\n\n\n<p>Here is the full code :<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">import java.io.*;\nimport java.util.*;\n\npublic class Main {\n    private static class Node {\n        int data;\n        ArrayList &lt; Node > children = new ArrayList &lt; > ();\n    }\n\n    public static void display(Node node) {\n        String str = node.data + \" -> \";\n        for (Node child: node.children) {\n            str += child.data + \", \";\n        }\n        str += \".\";\n        System.out.println(str);\n\n        for (Node child: node.children) {\n            display(child);\n        }\n    }\n\n    public static Node construct(int[] arr) {\n        Node root = null;\n\n        Stack &lt; Node > st = new Stack &lt; > ();\n        for (int i = 0; i &lt; arr.length; i++) {\n            if (arr[i] == -1) {\n                st.pop();\n            } else {\n                Node t = new Node();\n                t.data = arr[i];\n\n                if (st.size() > 0) {\n                    st.peek().children.add(t);\n                } else {\n                    root = t;\n                }\n\n                st.push(t);\n            }\n        }\n\n        return root;\n    }\n\n    public static int size(Node node){\n   \n    if(node==null)return 0;\n    int size = 0;\n    for(Node child : node.children)\n    {\n        int childSize = size(child);\n        size = size + childSize;\n    }\n    return size+1 ;\n\n  }\n\n\n    public static void main(String[] args) throws Exception {\n        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n        int n = Integer.parseInt(br.readLine());\n        int[] arr = new int[n];\n        String[] values = br.readLine().split(\" \");\n        for (int i = 0; i &lt; n; i++) {\n            arr[i] = Integer.parseInt(values[i]);\n        }\n\n        Node root = construct(arr);\n        int sz = size(root);\n        System.out.println(\u201cSize : \u201d + sz);\n        }\n\n}\n<\/pre>\n\n\n\n<p><strong>Input:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>12\r\n11 25 -1 37 55 -1 68 -1 -1 41 -1 -1\r<\/code><\/pre>\n\n\n\n<p><strong>Output:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Size : 6\r<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"What_is_Height_of_a_generic_tree\"><\/span><strong>What is Height of a generic tree ?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Now , let\u2019s learn about the height of generic trees.<\/p>\n\n\n\n<p>What is Height of a tree and how to calculate the height of a generic tree using java ?<\/p>\n\n\n\n<p>If we calculate height in terms of edges then, Height of a tree is the number of edges in the longest downward path from root to the leaf node.<\/p>\n\n\n\n<p>For, example consider this tree,<\/p>\n\n\n\n<p>Height of this tree in terms of edges is 3.<\/p>\n\n\n\n<p>If we calculate Height of a tree in terms of the nodes, then Height of a tree is the number of nodes in the longest downward path from root to the leaf node.<\/p>\n\n\n\n<p>Taking the example of same above tree,<\/p>\n\n\n\n<p>Height of the above tree in terms of nodes is 4.<\/p>\n\n\n\n<p>General Formula for calculator height of a generic tree can be given by :<\/p>\n\n\n\n<p>Height(tree) = MAX(Height(subtree1),Height(subtree2), \u2026\u2026. , Height(subtreeN) ) + 1<\/p>\n\n\n\n<p>E.g.&nbsp; Height(10) = MAX(Height(20), Height(30) , Height(40) ) + 1<\/p>\n\n\n\n<p>Using recursion, our expectation with this function Height(10) = MAX(Height(20), Height(30) , Height(40) ) + 1.<\/p>\n\n\n\n<p>And our faith is that function Height(20), Height(30) , Height(40) knows how to calculate their height. Then we add 1 in the Result, which calculates the height of our generic tree.<\/p>\n\n\n\n<p><strong>ALGORITHM<\/strong><\/p>\n\n\n\n<ol><li>In function height, declare an integer named ht and initialise it with -1 (to calc. Height in terms of edges ) or 0 (calc. Height in terms of node).<\/li><li>Build a for loop to calculate Height of each child subtree in the children list.<\/li><li>Compare the height of all subtree child and store the maximum.<\/li><li>Return the max subtree height + 1.<\/li><\/ol>\n\n\n\n<p>Let\u2019s code the height function :<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">public static int height(Node node) {\n\n        int max_height = -1; \/\/ it calculates height in terms of edges\n        for(Node child : node.children)\n        {\n            max_height = Math.max(max_height,height(child));\n        }\n        return max_height+1;\n    }\n  }\n<\/pre>\n\n\n\n<p><strong>Full code:<\/strong><\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">import java.io.*;\nimport java.util.*;\n\npublic class Main {\n  private static class Node {\n    int data;\n    ArrayList&lt;Node> children = new ArrayList&lt;>();\n  }\n\n  public static void display(Node node) {\n    String str = node.data + \" -> \";\n    for (Node child : node.children) {\n      str += child.data + \", \";\n    }\n    str += \".\";\n    System.out.println(str);\n\n    for (Node child : node.children) {\n      display(child);\n    }\n  }\n\n  public static Node construct(int[] arr) {\n    Node root = null;\n\n    Stack&lt;Node> st = new Stack&lt;>();\n    for (int i = 0; i &lt; arr.length; i++) {\n      if (arr[i] == -1) {\n        st.pop();\n      } else {\n        Node t = new Node();\n        t.data = arr[i];\n\n        if (st.size() > 0) {\n          st.peek().children.add(t);\n        } else {\n          root = t;\n        }\n\n        st.push(t);\n      }\n    }\n\n    return root;\n  }\n\n  public static int size(Node node) {\n    int s = 0;\n\n    for (Node child : node.children) {\n      s += size(child);\n    }\n    s += 1;\n\n    return s;\n  }\n\n  public static int max(Node node) {\n    int m = Integer.MIN_VALUE;\n\n    for (Node child : node.children) {\n      int cm = max(child);\n      m = Math.max(m, cm);\n    }\n    m = Math.max(m, node.data);\n\n    return m;\n  }\n\n  public static int height(Node node) {\n\n        int max_height = -1;\n        for(Node child : node.children)\n        {\n            max_height = Math.max(max_height,height(child));\n        }\n        return max_height+1;\n    }\n  }\n\n  public static void main(String[] args) throws Exception {\n    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n    int n = Integer.parseInt(br.readLine());\n    int[] arr = new int[n];\n    String[] values = br.readLine().split(\" \");\n    for (int i = 0; i &lt; n; i++) {\n      arr[i] = Integer.parseInt(values[i]);\n    }\n\n    Node root = construct(arr);\n    int h = height(root);\n    System.out.println(\u201cHeight of Tree :\u201d + h);\n      }\n\n}\n<\/pre>\n\n\n\n<p>Input:<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>12\r\n10 20 -1 30 50 -1 60 -1 -1 40 -1 -1\r<\/code><\/pre>\n\n\n\n<p>Output :<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Height of Tree : 2\r<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"How_To_Find_Maximum_in_a_generic_tree\"><\/span><strong>How To Find Maximum in a generic tree ?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Now , Let\u2019s learn How to find the maximum in a generic ,<\/p>\n\n\n\n<p>Maximum with word is self explanatory that we are going to search for the maximum \/ greatest node in the given generic tree.<\/p>\n\n\n\n<p>Using recursion, the general formula for calculating the maximum is ,<\/p>\n\n\n\n<p>max ( tree ) = MAX ( tree.data , max(subtree1) , \u2026\u2026\u2026 , max(subtreeN) )&nbsp;<\/p>\n\n\n\n<p>For example take this given tree again,<\/p>\n\n\n\n<p>max (10) = MAX ( 10 , max(20) , max(30) , max(40) )<\/p>\n\n\n\n<p>Therefore, maximum = 120<\/p>\n\n\n\n<p><strong>ALGORITHM :\u00a0<\/strong><\/p>\n\n\n\n<ol><li>Make a max function<\/li><li>Declare and initialise max_child integer variable and assign it with Integer.MIN_VALUE (minimum int value).<\/li><li>Now compare each child from children list using a loop.<\/li><li>Return max between max_child and data of the current parent node.<\/li><\/ol>\n\n\n\n<p>Now, let\u2019s code the max function :<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">public static int max(Node node) {\n    \n    int max_child = Integer.MIN_VALUE;\n    for(Node child:node.children)\n    {\n        max_child = Math.max(max_child,max(child));\n    }\n    int d = node.data;\n    return Math.max(d,max_child);\n  }<\/pre>\n\n\n\n<p><strong>Full Code:<\/strong><\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">import java.io.*;\nimport java.util.*;\n\npublic class Main {\n  private static class Node {\n    int data;\n    ArrayList&lt;Node> children = new ArrayList&lt;>();\n  }\n\n  public static void display(Node node) {\n    String str = node.data + \" -> \";\n    for (Node child : node.children) {\n      str += child.data + \", \";\n    }\n    str += \".\";\n    System.out.println(str);\n\n    for (Node child : node.children) {\n      display(child);\n    }\n  }\n\n  public static Node construct(int[] arr) {\n    Node root = null;\n\n    Stack&lt;Node> st = new Stack&lt;>();\n    for (int i = 0; i &lt; arr.length; i++) {\n      if (arr[i] == -1) {\n        st.pop();\n      } else {\n        Node t = new Node();\n        t.data = arr[i];\n\n        if (st.size() > 0) {\n          st.peek().children.add(t);\n        } else {\n          root = t;\n        }\n\n        st.push(t);\n      }\n    }\n\n    return root;\n  }\n\n  public static int size(Node node) {\n    int s = 0;\n\n    for (Node child : node.children) {\n      s += size(child);\n    }\n    s += 1;\n\n    return s;\n  }\n\n  public static int max(Node node) {\n    \n    int max_child = Integer.MIN_VALUE;\n    for(Node child:node.children)\n    {\n        max_child = Math.max(max_child,max(child));\n    }\n    int d = node.data;\n    return Math.max(d,max_child);\n  }\n\n  public static void main(String[] args) throws Exception {\n    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n    int n = Integer.parseInt(br.readLine());\n    int[] arr = new int[n];\n    String[] values = br.readLine().split(\" \");\n    for (int i = 0; i &lt; n; i++) {\n      arr[i] = Integer.parseInt(values[i]);\n    }\n\n    Node root = construct(arr);\n    int m = max(root);\n    System.out.println(m);\n    \/\/ display(root);\n  }\n\n}\n<\/pre>\n\n\n\n<p><strong>Input:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>12\r\n10 20 -1 30 50 -1 60 -1 -1 40 -1 -1\r<\/code><\/pre>\n\n\n\n<p><strong>Output:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>60<\/code><\/pre>\n\n\n\n<p>Today you learn 3 important topics of generic tree and how to implement the t=code of the same.<\/p>\n\n\n\n<p>Thanks for reading and learning for <strong>CodingBroz<\/strong>, for more such articles read more.<\/p>\n\n\n\n<p><strong>Broz Who Code<\/strong><\/p>\n\n\n\n<p><strong>CodingBroz<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"<p>This is a java program to calculate size , height and maximum element in a generic tree. If you don\u2019t know \u201cWhat is a generic tree ?\u201d Learn about the basics of Generic Tree and its implementation in java , here. What is Size of a generic tree ? Size of a tree is the [&hellip;]<\/p>\n","protected":false},"author":3,"featured_media":572,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"default","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"default","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[31,422],"tags":[22,61,95],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/02\/program-to-find-the-size-of-a-generic-tree-codingbroz.png","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/570"}],"collection":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=570"}],"version-history":[{"count":3,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/570\/revisions"}],"predecessor-version":[{"id":4945,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/570\/revisions\/4945"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media\/572"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=570"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=570"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=570"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}