{"id":8799,"date":"2025-07-31T22:54:16","date_gmt":"2025-07-31T17:24:16","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=8799"},"modified":"2025-07-31T22:55:37","modified_gmt":"2025-07-31T17:25:37","slug":"same-tree","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/same-tree\/","title":{"rendered":"Same Tree"},"content":{"rendered":"\n<!--Same Tree -->\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: #f8c291;\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.wp_blog_explanation h5{\n  color: var(--primary);\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.wp_blog_explanation code {\n  background: #f9cea6;\n  color: #2d2d2d;\n  padding: 3px 6px;\n  border-radius: 4px;\n  font-family: 'Courier New', monospace;\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.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.wp_blog_code-tab-button:hover {\n  background: var(--secondary);\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.wp_blog_code-tab-content.active {\n  display: block;\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<\/style>\n\n<div class=\"wp_blog_container wp_blog_theme\"> \n    <h1 class=\"wp_blog_main-heading\"><\/h1>\n    <div class=\"wp_blog_explanation\">\n        <h2>Problem Statement:<\/h2>\n        <p>Given the roots of two binary trees <code>p<\/code> and <code>q<\/code>, write a function to check if they are the same or not.<\/p>\n        <p>Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.<\/p>       \n        \n        <h2>Examples:<\/h2>\n                <h3>Example 1:<\/h3>\n               <img decoding=\"async\" src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/07\/Screenshot-2025-07-31-at-10.28.38\u202fPM.png\" alt=\"\">\n                <p><strong>Input:<\/strong> p = [1,2,3], q = [1,2,3]<\/p>\n                <p><strong>Output:<\/strong> true<\/p>\n\n                <h3>Example 2:<\/h3>\n               <img decoding=\"async\" src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/07\/Screenshot-2025-07-31-at-10.30.46\u202fPM.png\" alt=\"\">\n                <p><strong>Input:<\/strong> p = [1,2], q = [1,null,2]<\/p>\n                <p><strong>Output:<\/strong> false<\/p>\n\n                <h3>Example 3:<\/h3>\n                <img decoding=\"async\" src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/07\/Screenshot-2025-07-31-at-10.29.03\u202fPM.png\" alt=\"\">\n                <p><strong>Input: <\/strong> p = [1,2,1], q = [1,1,2]<\/p>\n                <p><strong>Output: <\/strong>false<\/p>\n\n                    <h2>Constraints:<\/h2>\n                    <ul>\n                      <li>The number of nodes in the tree is in the range <code>[0, 100]<\/code>.<\/li>\n                      <li><code>-10<sup>4<\/sup> <= Node.val <= 10<sup>4<\/sup><\/code><\/li>\n                    <\/ul>\n\n                <h2>Approach<\/h2>\n            <ul>\n                <li><strong>Base Case: <\/strong>\n                <ul>\n                    <li>If both nodes are <code>null<\/code>, they are the same \u2013 return <code>true<\/code>.<\/li>\n                    <li>If one is <code>null<\/code> and the other is not \u2013 return <code>false<\/code>.<\/li>\n                <\/ul>\n                <\/li>  \n\n                <li><strong>Recursive Case: <\/strong>\n                <ul>\n                    <li>Check if current nodes have the same value.<\/li>\n                    <li>Recursively check their left subtrees and right subtrees.<\/li>\n                <\/ul>\n                <\/li>\n            <\/ul>\n\n                <h2>Time Complexity:<\/h2>\n                <li>\n                  <p><strong>Time Complexity = O(n)<\/strong>\n                  <\/li>\n                <h2>Space Complexity:<\/h2>\n                <li>\n                  <p><strong>Space Complexity = O(n)<\/strong><\/p>\n                <\/li>\n\n<h2>Dry Run<\/h2> <div style=\"background: #f9f9f9; padding: 10px; border: 1px solid #ccc; font-family: monospace;\">\n<b>Function Call:<\/b> isSameTree(p, q) where<br>\np = TreeNode(1)<br>\n\u251c\u2500\u2500 left: TreeNode(2)<br>\n\u2514\u2500\u2500 right: TreeNode(3)<br><br>\nq = TreeNode(1)<br>\n\u251c\u2500\u2500 left: TreeNode(2)<br>\n\u2514\u2500\u2500 right: TreeNode(3)<br><br>\n<b>Step 1:<\/b><br>\n\u2192 p = 1, q = 1<br>\n\u2192 Both nodes are not null \u2192 OK<br>\n\u2192 Compare p.val (1) == q.val (1) \u2192 <br>\n\u2192 Recursively call isSameTree(p.left, q.left)<br><br>\n<b>Step 2:<\/b><br>\n\u2192 p = 2, q = 2<br>\n\u2192 Both nodes are not null \u2192 OK<br>\n\u2192 Compare p.val (2) == q.val (2) \u2192 <br>\n\u2192 Recursively call isSameTree(p.left, q.left)<br><br>\n<b>Step 3:<\/b><br>\n\u2192 p = null, q = null<br>\n\u2192 Both nodes are null \u2192 Return true<br><br>\n\u2192 Back to Step 2, now call isSameTree(p.right, q.right)<br>\n<b>Step 4:<\/b><br>\n\u2192 p = null, q = null<br>\n\u2192 Both nodes are null \u2192  Return true<br><br>\n\u2192 Back to Step 2 \u2192 Left and Right both returned true \u2192  Return true<br><br>\n\u2192 Back to Step 1, now call isSameTree(p.right, q.right)<br>\n<b>Step 5:<\/b><br>\n\u2192 p = 3, q = 3<br>\n\u2192 Both nodes are not null \u2192 OK<br>\n\u2192 Compare p.val (3) == q.val (3) \u2192 <br>\n\u2192 Recursively call isSameTree(p.left, q.left)<br><br>\n<b>Step 6:<\/b><br>\n\u2192 p = null, q = null<br>\n\u2192 Both nodes are null \u2192 Return true<br><br>\n\u2192 Back to Step 5, now call isSameTree(p.right, q.right)<br>\n<b>Step 7:<\/b><br>\n\u2192 p = null, q = null<br>\n\u2192 Both nodes are null \u2192 Return true<br><br>\n\u2192 Back to Step 5 \u2192 Left and Right both returned true \u2192 Return true<br><br>\n\u2192 Back to Step 1 \u2192 Left and Right both returned true \u2192 Return true<br><br>\n<b>Final Result:<\/b> true\n<\/div>\n    \n    <!-- <h2>Visualisation:<\/h2>\n        <img decoding=\"async\" src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/07\/Screenshot-2025-07-19-at-5.23.43\u202fPM.png\" alt=\"longest\" \/> -->\n    <\/div>\n    \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\">JavaScript<\/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        <!-- JavaScript -->\n        <div class=\"wp_blog_code-tab-content active\" data-lang=\"js\">\n            <pre><code class=\"language-javascript\">\nvar isSameTree = function(p, q) {\n  if(!p && !q) return true;\n  if(!p || !q) return false;\n\n  return p.val === q.val && \n  isSameTree(p.left, q.left) &&\n  isSameTree(p.right, q.right);  \n};\n     <\/code><\/pre>\n        <\/div>\n\n        <!-- Python -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"py\">\n            <pre><code class=\"language-python\">\nclass TreeNode:\n    def __init__(self, val=0, left=None, right=None):\n        self.val = val\n        self.left = left\n        self.right = right\n\ndef isSameTree(p, q):\n    if not p and not q:\n        return True\n    if not p or not q:\n        return False\n    return p.val == q.val and \\\n           isSameTree(p.left, q.left) and \\\n           isSameTree(p.right, q.right)\n            <\/code><\/pre>\n        <\/div>\n\n        <!-- Java -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"java\">\n            <pre><code class=\"language-java\">\nclass TreeNode {\n    int val;\n    TreeNode left, right;\n    TreeNode(int x) { val = x; }\n}\n\npublic class Solution {\n    public boolean isSameTree(TreeNode p, TreeNode q) {\n        if (p == null && q == null) return true;\n        if (p == null || q == null) return false;\n\n        return p.val == q.val &&\n               isSameTree(p.left, q.left) &&\n               isSameTree(p.right, q.right);\n    }\n}\n     <\/code><\/pre>\n        <\/div>\n\n        <!-- C++ -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"cpp\">\n            <pre><code class=\"language-cpp\">\nstruct TreeNode {\n    int val;\n    TreeNode *left;\n    TreeNode *right;\n};\n\nbool isSameTree(TreeNode* p, TreeNode* q) {\n    if (!p && !q) return true;\n    if (!p || !q) return false;\n\n    return p->val == q->val &&\n           isSameTree(p->left, q->left) &&\n           isSameTree(p->right, q->right);\n}\n    <\/code><\/pre>\n        <\/div>\n\n        <!-- C -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"c\">\n            <pre><code class=\"language-c\">\ntypedef struct TreeNode {\n    int val;\n    struct TreeNode* left;\n    struct TreeNode* right;\n} TreeNode;\n\nint isSameTree(TreeNode* p, TreeNode* q) {\n    if (!p && !q) return 1;\n    if (!p || !q) return 0;\n\n    return (p->val == q->val) &&\n           isSameTree(p->left, q->left) &&\n           isSameTree(p->right, q->right);\n}\n            <\/code><\/pre>\n        <\/div>\n\n        <!-- C# -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"cs\">\n            <pre><code class=\"language-csharp\">\npublic class TreeNode {\n    public int val;\n    public TreeNode left;\n    public TreeNode right;\n}\n\npublic class Solution {\n    public bool IsSameTree(TreeNode p, TreeNode q) {\n        if (p == null && q == null) return true;\n        if (p == null || q == null) return false;\n\n        return p.val == q.val &&\n               IsSameTree(p.left, q.left) &&\n               IsSameTree(p.right, q.right);\n    }\n}\n            <\/code><\/pre>\n        <\/div>\n    <\/div>\n<\/div>\n\n<script>\n    document.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) =>\n                    content.classList.remove(\"active\")\n                );\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<\/script>\n","protected":false},"excerpt":{"rendered":"<p>Problem Statement: Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical, and the nodes have the same value. Examples: Example 1: Input: p = [1,2,3], q = [1,2,3] Output: true<\/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,176,175,211,810,174,172,173],"tags":[],"class_list":["post-8799","post","type-post","status-publish","format-standard","category-algorithms","category-csharp","category-cplusplus","category-data-structures","category-dsa","category-java","category-javascript","category-python"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/8799","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=8799"}],"version-history":[{"count":1,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/8799\/revisions"}],"predecessor-version":[{"id":8805,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/8799\/revisions\/8805"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=8799"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=8799"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=8799"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}