{"id":11467,"date":"2026-01-31T18:43:47","date_gmt":"2026-01-31T13:13:47","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=11467"},"modified":"2026-01-31T18:45:56","modified_gmt":"2026-01-31T13:15:56","slug":"insert-search-prefixfind-trie-code","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/insert-search-prefixfind-trie-code\/","title":{"rendered":"Insert, Search, PrefixFind Trie Code"},"content":{"rendered":"\n<!-- PrismJS for Syntax Highlighting -->\n<link\n    href=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/themes\/prism-tomorrow.min.css\"\n    rel=\"stylesheet\"\n\/>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/prism.min.js\"><\/script>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/plugins\/autoloader\/prism-autoloader.min.js\"><\/script>\n\n<style>\n.wp_blog_theme {\n  --primary: #E58C32;\n  --secondary: #030302;\n  --light-bg: #fef9f4;\n  --text-dark: #2d2d2d;\n  --tab-radius: 12px;\n  --shadow: 0 4px 12px rgba(0, 0, 0, 0.08);\n  --code-bg: #001f3f;\n  --code-text: #d4f1ff;\n}\n\n.wp_blog_container {\n  font-family: 'Segoe UI', sans-serif;\n  background: var(--light-bg);\n  margin: 0;\n  padding: 0;\n  color: var(--text-dark);\n}\n\n\/* Heading *\/\n.wp_blog_main-heading {\n  text-align: center;\n  font-size: 2.4rem;\n  color: var(--primary);\n  margin-top: 2.5rem;\n  font-weight: bold;\n}\n\n\/* Explanation Card *\/\n.wp_blog_explanation,\n.wp_blog_code-tabs-container {\n  max-width: 940px;\n  margin: 2rem auto;\n  padding: 2rem;\n  background: white;\n  border-radius: var(--tab-radius);\n  box-shadow: var(--shadow);\n}\n\n\/* Text and Visuals *\/\n.wp_blog_explanation h2 {\n  font-size: 1.4rem;\n  color: var(--primary);\n  margin-bottom: 0.5rem;\n}\n\n.wp_blog_explanation p,\n.wp_blog_explanation li {\n  font-size: 1.05rem;\n  line-height: 1.7;\n  margin: 0.5rem 0;\n}\n\n.wp_blog_explanation code {\n  background: #fef9f4;   \/* light bg instead of dark blue *\/\n  color: #E58C32;        \/* brand orange *\/\n  padding: 3px 6px;\n  border-radius: 4px;\n  font-family: 'Courier New', monospace;\n  font-weight: 600;      \/* optional, makes it pop *\/\n}\n\n.wp_blog_explanation img {\n  max-width: 100%;\n  border-radius: var(--tab-radius);\n  margin-top: 1rem;\n  box-shadow: 0 2px 12px rgba(0, 0, 0, 0.06);\n}\n\n\/* Tab Buttons *\/\n.wp_blog_code-tabs-header {\n  display: flex;\n  flex-wrap: wrap;\n  gap: 0.5rem;\n  margin-bottom: 1rem;\n}\n\n.wp_blog_code-tab-button {\n  padding: 0.6rem 1.2rem;\n  border: 1px solid var(--primary);\n  background: white;\n  color: var(--primary);\n  border-radius: 50px;\n  font-weight: 600;\n  cursor: pointer;\n  transition: all 0.3s ease;\n}\n\n.wp_blog_code-tab-button:hover {\n  background: var(--secondary);\n}\n\n.wp_blog_code-tab-button.active {\n  background: var(--primary);\n  color: white;\n}\n\n\/* Code Content *\/\n.wp_blog_code-tab-content {\n  display: none;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n}\n\n.wp_blog_code-tab-content.active {\n  display: block;\n}\n\n.wp_blog_code-tab-content pre {\n  margin: 0;\n  padding: 1.5rem;\n  font-size: 1rem;\n  overflow-x: auto;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n  color: var(--code-text);\n}\n\n\/* Dark mode variables *\/\n.wp_blog_theme.dark-mode {\n  --light-bg: #121212;\n  --text-dark: #f5f5f5;\n  --shadow: 0 4px 12px rgba(255, 255, 255, 0.08);\n  --code-bg: #1e1e1e;\n  --code-text: #c5f0ff;\n}\n\n.wp_blog_theme.dark-mode .wp_blog_explanation {\n  background: #1e1e1e;\n}\n\n\/* Dark mode code highlight *\/\n.wp_blog_theme.dark-mode .wp_blog_explanation code {\n  background: #333;\n  color: #ffd27f;\n}\n\n.wp_blog_theme {\n  position: relative; \/* makes it the reference for absolute children *\/\n}\n\n.wp_blog_toggle-btn {\n  position: absolute;\n  top: 1rem;\n  right: 1rem;\n  z-index: 9999;\n  padding: 0.5rem 0.8rem;\n  border-radius: 10%;\n  background: var(--primary);\n  color: white;\n  font-weight: bold;\n  cursor: pointer;\n  border: none;\n  box-shadow: var(--shadow);\n  transition: background 0.3s, transform 0.2s;\n}\n\n.wp_blog_toggle-btn:hover {\n  background: #cc772e;\n}\n\n.wp_blog_theme.dark-mode .wp_blog_code-tabs-container {\n  background: #1e1e1e;\n}\n<\/style>\n\n<div class=\"wp_blog_container wp_blog_theme\">\n            <button id=\"blogNotesThemeToggle\" class=\"wp_blog_toggle-btn\">\ud83c\udf19<\/button>\n\n<h1 class=\"wp_blog_main-heading\"><\/h1>\n\n<div class=\"wp_blog_explanation\">\n    <h2>Problem Statement:<\/h2>\n    <p>\n        A trie (pronounced as &#8220;try&#8221;) or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker.\n    <\/p>\n\n    <p>Implement the Trie Class: <\/p>\n    <ul>\n        <li>Trie() Initializes the trie object.<\/li>\n        <li>void insert(String word) Inserts the string word into the trie.<\/li>\n        <li>boolean search(String word) Returns true if the string word is in the trie (i.e., was inserted before), and false otherwise.<\/li>\n        <li>boolean startsWith(String prefix) Returns true if there is a previously inserted string word that has the prefix prefix, and false otherwise.<\/li>\n    <\/ul>\n\n    <h2>Example 1<\/h2>\n    <p><strong>Example 1:<\/strong><\/p>\n    <p><strong>Input:<\/strong>\n        [&#8220;Trie&#8221;, &#8220;insert&#8221;, &#8220;search&#8221;, &#8220;search&#8221;, &#8220;startsWith&#8221;, &#8220;insert&#8221;, &#8220;search&#8221;]\n        [[], [&#8220;apple&#8221;], [&#8220;apple&#8221;], [&#8220;app&#8221;], [&#8220;app&#8221;], [&#8220;app&#8221;], [&#8220;app&#8221;]]\n    <\/p>\n    <p><strong>Output:<\/strong><code>[null, null, true, false, true, null, true]<\/code><\/p>\n    <p><strong>Explanation<\/strong>\n    Trie trie = new Trie();\n    trie.insert(&#8220;apple&#8221;);\n    trie.search(&#8220;apple&#8221;);   \/\/ return True\n    trie.search(&#8220;app&#8221;);     \/\/ return False\n    trie.startsWith(&#8220;app&#8221;); \/\/ return True\n    trie.insert(&#8220;app&#8221;);\n    trie.search(&#8220;app&#8221;);     \/\/ return True\n    <\/p>\n    <h2>Constraints:<\/h2>\n    <ul>\n        <li><code>1 <= word.length, prefix.length <= 2000<\/code><\/li>\n        <li>word and prefix consist only of lowercase English letters<\/li>\n        <li>At most 3 * 10<sup>4<\/sup> calls in total will be made to insert, search, and startsWith.<\/li>\n    <\/ul>\n\n    <h2>Approach<\/h2>\n<ul>\n    <li>We use a Trie (Prefix Tree) to store words character by character.<\/li>\n    <li>Each node represents a character and contains:\n        <ul>\n            <li><code>children:<\/code> links to next characters.<\/li>\n            <li><code>isEndOfWord:<\/code> marks completion of a word.<\/li>\n        <\/ul>\n    <\/li>\n    <li><strong>Insertion (insert)<\/strong><\/li>\n    <li>Start from the root.<\/li>\n    <li>For each character in the word:\n        <ul>\n            <li>If the character node doesn\u2019t exist, create it.<\/li>\n            <li>Move to that node.<\/li>\n        <\/ul>\n    <\/li>\n    <li>After the last character, mark <code>isEndOfWord = true.<\/code><\/li>\n\n    <li><strong>Search (search)<\/strong><\/li>\n    <li>Start from the root.<\/li>\n    <li>Traverse characters of the word.<\/li>\n    <li>If any character is missing, the word doesn\u2019t exist.<\/li>\n    <li>If traversal ends and isEndOfWord is true, the word exists.<\/li>\n\n    <li><strong>Prefix Check (<code>startsWith<\/code>)<\/strong><\/li>\n    <li>Start from the root.<\/li>\n    <li>Traverse characters of the prefix.<\/li>\n    <li>If all characters exist, the prefix is present (no need to check isEndOfWord).<\/li>\n<\/ul>\n                <h2>Time Complexity:<\/h2>\n                <li>\n                  <p><strong>Insertion  \u2192 O(L)<\/strong> where: 'L' length of the word.<\/p>\n                  <p><strong>Search \u2192 O(L)<\/strong><\/p>\n                  <p><strong>Prefix \u2192 O(P)<\/strong><\/p>\n                    <\/li> \n                <h2>Space Complexity:<\/h2>\n                <li>\n                  <p><strong>Insertion \u2192 O(N x L)<\/strong><\/p>\n                  <p><strong>Search \u2192 O(1)<\/strong><\/p>\n                <li><strong>Prefix \u2192 O(1)<\/strong><\/li>  \n                <\/p>\n                <\/li>\n<h2>Dry Run<\/h2> <div style=\"background: var(--light-bg); border-left: 4px solid var(--primary); padding: 1rem; border-radius: var(--tab-radius); margin: 1rem 0; color: var(--text-dark);\"> \n<p><strong>Input:<\/strong><\/p> <pre style=\"white-space: pre-wrap; background: var(--code-bg); padding: 1rem; border-radius: 8px; overflow-x: auto; color: var(--code-text);\"> \nOperations: insert(\"cat\") insert(\"car\") search(\"cat\") search(\"cap\") startsWith(\"ca\") <\/pre> <p><strong>State Transitions:<\/strong><\/p> \n\n<pre style=\"white-space: pre-wrap; background: var(--code-bg); padding: 1rem; border-radius: 8px; overflow-x: auto; color: var(--code-text);\"> Initially: root = {}\n\n    insert(\"cat\"): curr = root\nchar = 'c' \u2192 not present \u2192 create TrieNode, move to children['c']\nchar = 'a' \u2192 not present \u2192 create TrieNode, move to children['a']\nchar = 't' \u2192 not present \u2192 create TrieNode, move to children['t']\nMark isEndOfWord = true at 't'\nTrie structure: c \u2192 a \u2192 t (end)\ninsert(\"car\"): curr = root\nchar = 'c' \u2192 exists \u2192 move\nchar = 'a' \u2192 exists \u2192 move\nchar = 'r' \u2192 not present \u2192 create TrieNode, move\nMark isEndOfWord = true at 'r'\nTrie structure: c \u2192 a \u2192 t (end), a \u2192 r (end)\nsearch(\"cat\"): curr = root\nchar = 'c' \u2192 exists \u2192 move\nchar = 'a' \u2192 exists \u2192 move\nchar = 't' \u2192 exists \u2192 move\nisEndOfWord = true \u2192 Returns: <strong>true<\/strong>\nsearch(\"cap\"): curr = root\nchar = 'c' \u2192 exists \u2192 move\nchar = 'a' \u2192 exists \u2192 move\nchar = 'p' \u2192 NOT present \u2192 Returns: <strong>false<\/strong>\nstartsWith(\"ca\"): curr = root\nchar = 'c' \u2192 exists \u2192 move\nchar = 'a' \u2192 exists \u2192 move\nAll prefix characters found \u2192 Returns: <strong>true<\/strong>\n<\/pre>\n<p><strong>Final State:<\/strong> Stored words in Trie: <code>\"cat\"<\/code>, <code>\"car\"<\/code>. Prefix <code>\"ca\"<\/code> exists, but <code>\"cap\"<\/code> does not.<\/p> <\/div>\n<\/div>\n\n<div class=\"wp_blog_code-tabs-container\">\n    <div class=\"wp_blog_code-tabs-header\">\n        <button class=\"wp_blog_code-tab-button active\" data-lang=\"js\">\n            JavaScript\n        <\/button>\n        <button class=\"wp_blog_code-tab-button\" data-lang=\"py\">Python<\/button>\n        <button class=\"wp_blog_code-tab-button\" data-lang=\"java\">Java<\/button>\n        <button class=\"wp_blog_code-tab-button\" data-lang=\"cpp\">C++<\/button>\n        <button class=\"wp_blog_code-tab-button\" data-lang=\"c\">C<\/button>\n        <button class=\"wp_blog_code-tab-button\" data-lang=\"cs\">C#<\/button>\n    <\/div>\n\n    <div class=\"wp_blog_code-tab-content active\" data-lang=\"js\">\n       \n<pre><code class=\"language-javascript\">\nclass TrieNode {\n    constructor() {\n        this.children = {};\n        this.isEndOfWord = false;\n    }\n}\n\nclass Trie {\n    constructor() {\n        this.root = new TrieNode();\n    }\n\n    insert(word) {\n        let curr = this.root;\n        for (let char of word) {\n            if (!curr.children[char]) {\n                curr.children[char] = new TrieNode();\n            }\n            curr = curr.children[char];\n        }\n        curr.isEndOfWord = true;\n    }\n\n    search(word) {\n        let curr = this.root;\n        for (let char of word) {\n            if (!curr.children[char]) {\n                return false;\n            }\n            curr = curr.children[char];\n        }\n        return curr.isEndOfWord;\n    }\n\n    startsWith(prefix) {\n        let curr = this.root;\n        for (let char of prefix) {\n            if (!curr.children[char]) {\n                return false;\n            }\n            curr = curr.children[char];\n        }\n        return true;\n    }\n}\n\n<\/code><\/pre>\n\n<\/div>\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"py\">\n        <pre><code class=\"language-python\">\nclass TrieNode:\n    def __init__(self):\n        self.children = {}\n        self.is_end_of_word = False\n\n\nclass Trie:\n    def __init__(self):\n        self.root = TrieNode()\n\n    def insert(self, word: str) -> None:\n        curr = self.root\n        for char in word:\n            if char not in curr.children:\n                curr.children[char] = TrieNode()\n            curr = curr.children[char]\n        curr.is_end_of_word = True\n\n    def search(self, word: str) -> bool:\n        curr = self.root\n        for char in word:\n            if char not in curr.children:\n                return False\n            curr = curr.children[char]\n        return curr.is_end_of_word\n\n    def startsWith(self, prefix: str) -> bool:\n        curr = self.root\n        for char in prefix:\n            if char not in curr.children:\n                return False\n            curr = curr.children[char]\n        return True\n\n    <\/code><\/pre>\n    <\/div>\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"java\">\n        <pre><code class=\"language-java\">\nimport java.util.HashMap;\nimport java.util.Map;\n\nclass TrieNode {\n    Map<Character, TrieNode> children = new HashMap<>();\n    boolean isEndOfWord = false;\n}\n\npublic class Trie {\n    private TrieNode root;\n\n    public Trie() {\n        root = new TrieNode();\n    }\n\n    public void insert(String word) {\n        TrieNode curr = root;\n        for (char c : word.toCharArray()) {\n            curr.children.putIfAbsent(c, new TrieNode());\n            curr = curr.children.get(c);\n        }\n        curr.isEndOfWord = true;\n    }\n\n    public boolean search(String word) {\n        TrieNode curr = root;\n        for (char c : word.toCharArray()) {\n            if (!curr.children.containsKey(c)) {\n                return false;\n            }\n            curr = curr.children.get(c);\n        }\n        return curr.isEndOfWord;\n    }\n\n    public boolean startsWith(String prefix) {\n        TrieNode curr = root;\n        for (char c : prefix.toCharArray()) {\n            if (!curr.children.containsKey(c)) {\n                return false;\n            }\n            curr = curr.children.get(c);\n        }\n        return true;\n    }\n}\n<\/code><\/pre>\n    <\/div>\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"cpp\">\n        <pre><code class=\"language-cpp\">\n#include &lt;unordered_map&gt;\n#include &lt;string&gt;\nusing namespace std;\n\nclass TrieNode {\npublic:\n    unordered_map<char, TrieNode*> children;\n    bool isEndOfWord;\n\n    TrieNode() {\n        isEndOfWord = false;\n    }\n};\n\nclass Trie {\nprivate:\n    TrieNode* root;\n\npublic:\n    Trie() {\n        root = new TrieNode();\n    }\n\n    void insert(string word) {\n        TrieNode* curr = root;\n        for (char c : word) {\n            if (!curr->children[c]) {\n                curr->children[c] = new TrieNode();\n            }\n            curr = curr->children[c];\n        }\n        curr->isEndOfWord = true;\n    }\n\n    bool search(string word) {\n        TrieNode* curr = root;\n        for (char c : word) {\n            if (!curr->children[c]) {\n                return false;\n            }\n            curr = curr->children[c];\n        }\n        return curr->isEndOfWord;\n    }\n\n    bool startsWith(string prefix) {\n        TrieNode* curr = root;\n        for (char c : prefix) {\n            if (!curr->children[c]) {\n                return false;\n            }\n            curr = curr->children[c];\n        }\n        return true;\n    }\n};\n    <\/code><\/pre>\n    <\/div>\n\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"c\">\n        <pre><code class=\"language-c\">\n#include &lt;stdio.h&gt;\n#include &lt;stdlib.h&gt;\n#include &lt;stdbool.h&gt;\n\n#define ALPHABET_SIZE 26\n\ntypedef struct TrieNode {\n    struct TrieNode* children[ALPHABET_SIZE];\n    bool isEndOfWord;\n} TrieNode;\n\nTrieNode* createNode() {\n    TrieNode* node = (TrieNode*)malloc(sizeof(TrieNode));\n    node->isEndOfWord = false;\n    for (int i = 0; i < ALPHABET_SIZE; i++) {\n        node->children[i] = NULL;\n    }\n    return node;\n}\n\nvoid insert(TrieNode* root, const char* word) {\n    TrieNode* curr = root;\n    while (*word) {\n        int index = *word - 'a';\n        if (!curr->children[index]) {\n            curr->children[index] = createNode();\n        }\n        curr = curr->children[index];\n        word++;\n    }\n    curr->isEndOfWord = true;\n}\n\nbool search(TrieNode* root, const char* word) {\n    TrieNode* curr = root;\n    while (*word) {\n        int index = *word - 'a';\n        if (!curr->children[index]) {\n            return false;\n        }\n        curr = curr->children[index];\n        word++;\n    }\n    return curr->isEndOfWord;\n}\n\nbool startsWith(TrieNode* root, const char* prefix) {\n    TrieNode* curr = root;\n    while (*prefix) {\n        int index = *prefix - 'a';\n        if (!curr->children[index]) {\n            return false;\n        }\n        curr = curr->children[index];\n        prefix++;\n    }\n    return true;\n}\n    <\/code><\/pre>\n    <\/div>\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"cs\">\n        <pre><code class=\"language-csharp\">\nusing System.Collections.Generic;\n\npublic class TrieNode {\n    public Dictionary<char, TrieNode> children = new Dictionary<char, TrieNode>();\n    public bool isEndOfWord = false;\n}\n\npublic class Trie {\n    private TrieNode root;\n\n    public Trie() {\n        root = new TrieNode();\n    }\n\n    public void Insert(string word) {\n        TrieNode curr = root;\n        foreach (char c in word) {\n            if (!curr.children.ContainsKey(c)) {\n                curr.children[c] = new TrieNode();\n            }\n            curr = curr.children[c];\n        }\n        curr.isEndOfWord = true;\n    }\n\n    public bool Search(string word) {\n        TrieNode curr = root;\n        foreach (char c in word) {\n            if (!curr.children.ContainsKey(c)) {\n                return false;\n            }\n            curr = curr.children[c];\n        }\n        return curr.isEndOfWord;\n    }\n\n    public bool StartsWith(string prefix) {\n        TrieNode curr = root;\n        foreach (char c in prefix) {\n            if (!curr.children.ContainsKey(c)) {\n                return false;\n            }\n            curr = curr.children[c];\n        }\n        return true;\n    }\n}\n  <\/code><\/pre>\n    <\/div>\n<\/div>\n<\/div>\n<script>\ndocument.addEventListener(\"DOMContentLoaded\", () => {\n  const buttons = document.querySelectorAll(\".wp_blog_code-tab-button\");\n  const contents = document.querySelectorAll(\".wp_blog_code-tab-content\");\n\n  buttons.forEach((button) => {\n    button.addEventListener(\"click\", () => {\n      const lang = button.getAttribute(\"data-lang\");\n\n      buttons.forEach((btn) => btn.classList.remove(\"active\"));\n      contents.forEach((content) => content.classList.remove(\"active\"));\n\n      button.classList.add(\"active\");\n      document\n        .querySelector(`.wp_blog_code-tab-content[data-lang=\"${lang}\"]`)\n        .classList.add(\"active\");\n    });\n  });\n\n  const themeToggle = document.getElementById(\"blogNotesThemeToggle\");\n  const themeContainer = document.querySelector(\".wp_blog_theme\");\n\n  themeToggle.addEventListener(\"click\", () => {\n    themeContainer.classList.toggle(\"dark-mode\");\n    themeToggle.textContent =\n      themeContainer.classList.contains(\"dark-mode\") ? \"\u2600\ufe0f\" : \"\ud83c\udf19\";\n  });\n});\n<\/script>\n","protected":false},"excerpt":{"rendered":"<p>\ud83c\udf19 Problem Statement: A trie (pronounced as &#8220;try&#8221;) or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker. Implement the Trie Class: Trie() Initializes the trie object. void insert(String word) Inserts the<\/p>\n","protected":false},"author":108,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[210,322,260,176,175,211,810,174,172,173],"tags":[],"class_list":{"0":"post-11467","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-algorithms","7":"category-algorithms-and-data-structures","8":"category-c-c-plus-plus","9":"category-csharp","10":"category-cplusplus","11":"category-data-structures","12":"category-dsa","13":"category-java","14":"category-javascript","15":"category-python"},"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/11467","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/users\/108"}],"replies":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/comments?post=11467"}],"version-history":[{"count":1,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/11467\/revisions"}],"predecessor-version":[{"id":11468,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/11467\/revisions\/11468"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=11467"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=11467"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=11467"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}