{"id":8395,"date":"2025-07-29T10:56:46","date_gmt":"2025-07-29T05:26:46","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=8395"},"modified":"2025-07-29T10:58:32","modified_gmt":"2025-07-29T05:28:32","slug":"dfs-bfs","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/dfs-bfs\/","title":{"rendered":"DFS and BFS in Binary Tree"},"content":{"rendered":"\n<!-- Prism.js for Code 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: #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    .wp_blog_main-heading {\n        text-align: center;\n        font-size: 2.6rem;\n        color: var(--primary);\n        margin-top: 3rem;\n        margin-bottom: 1.5rem;\n        font-weight: 700;\n    }\n\n    .wp_blog_explanation {\n        max-width: 940px;\n        margin: 0 auto 3rem auto;\n        padding: 2.5rem;\n        background: white;\n        border-radius: var(--tab-radius);\n        box-shadow: var(--shadow);\n    }\n\n    .wp_blog_explanation h2 {\n        font-size: 1.6rem;\n        color: var(--primary);\n        margin-bottom: 1rem;\n        border-left: 4px solid var(--primary);\n        padding-left: 10px;\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 ul {\n        margin-left: 1rem;\n        padding-left: 1rem;\n    }\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        font-size: 0.95rem;\n    }\n\n    .wp_blog_explanation strong {\n        color: var(--primary);\n    }\n\n    .wp_blog_explanation img {\n        max-width: 100%;\n        border-radius: var(--tab-radius);\n        margin: 1rem 0;\n        box-shadow: 0 2px 12px rgba(0, 0, 0, 0.06);\n    }\n\n    pre {\n        background: var(--code-bg);\n        color: var(--code-text);\n        padding: 1.2rem;\n        border-radius: var(--tab-radius);\n        overflow-x: auto;\n        margin-top: 1.2rem;\n        font-size: 0.95rem;\n        line-height: 1.6;\n    }\n\n    pre code {\n        background: none;\n        color: inherit;\n        padding: 0;\n    }\n\n    .wp_blog_explanation ul ul {\n        margin-top: 0.5rem;\n        margin-bottom: 1rem;\n    }\n<\/style>\n\n<div class=\"wp_blog_container wp_blog_theme\">\n    <h1 class=\"wp_blog_main-heading\"><\/h1>\n\n    <div class=\"wp_blog_explanation\">\n        <h2>DFS and BFS in Binary Tree:<\/h2>\n        <ul>\n            <li>\n                <code>DFS: <strong>Depth First Search<\/strong><\/code>\n                <ul>\n                    <li>\n                        DFS explores a tree by going as deep as possible along a\n                        branch before backtracking.\n                    <\/li>\n                <\/ul>\n            <\/li>\n            <li>\n                <code>BFS: <strong>Breadth First Search<\/strong><\/code>\n                <ul>\n                    <li>\n                        Explore the tree level by level, explore all nodes at\n                        the current level before moving deeper.\n                    <\/li>\n                <\/ul>\n            <\/li>\n        <\/ul>\n\n        <h2><code>DFS vs BFS<\/code><\/h2>\n        <ul>\n            <li>\n                <strong>DFS:<\/strong>\n                <ul>\n                    <li>\n                        <img decoding=\"async\"\n                            src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/07\/dfs.png\"\n                            alt=\"DFS\"\n                        \/>\n                    <\/li>\n                    <li>\n                        <code>Preorder: <strong>A B D E C F<\/strong><\/code>\n                    <\/li>\n                    <li>\n                        <code>Inorder: <strong>D B E A C F<\/strong><\/code>\n                    <\/li>\n                    <li>\n                        <code>Postorder: <strong>D E B F C A<\/strong><\/code>\n                    <\/li>\n                <\/ul>\n            <\/li>\n\n            <li>\n                <strong>BFS:<\/strong>\n                <ul>\n                    <li>\n                        <img decoding=\"async\"\n                            src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/07\/Screenshot-2025-07-29-at-10.16.38\u202fAM.png\"\n                            alt=\"BFS\"\n                        \/>\n                    <\/li>\n                    <li>\n                        <code\n                            >Level Order Traversal:\n                            <strong>A B C D E F<\/strong><\/code\n                        >\n                    <\/li>\n                <\/ul>\n            <\/li>\n\n            <li>\n                <strong>Zig-Zag Traversal:<\/strong>\n                <ul>\n                    <li>\n                        <img decoding=\"async\"\n                            src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/07\/Screenshot-2025-07-29-at-10.31.25\u202fAM.png\"\n                            alt=\"Zig-Zag\"\n                        \/>\n                    <\/li>\n                    <li>\n                        <code\n                            >Zig-Zag Traversal:\n                            <strong>A C B D E F<\/strong><\/code\n                        >\n                    <\/li>\n                <\/ul>\n            <\/li>\n        <\/ul>\n\n        <h2><code>DFS \/ BFS<\/code><\/h2>\n\n        <p><strong>DFS<\/strong> uses a <code>Stack (LIFO)<\/code><\/p>\n        <p><strong>First Explore Depth<\/strong><\/p>\n        <img decoding=\"async\"\n            src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/07\/Screenshot-2025-07-29-at-10.03.43\u202fAM.png\"\n            alt=\"DFS Stack\"\n        \/>\n\n        <pre>stack = [        ]\n<strong>LIFO<\/strong> (as stack uses LIFO)\ncurr = stack.pop()\npush children and repeat\n\nans = [A, C, F, B, E, D]\n<\/pre>\n\n        <p><strong>BFS<\/strong> uses a <code>Queue (FIFO)<\/code><\/p>\n        <p><strong>Level By Level<\/strong><\/p>\n        <img decoding=\"async\"\n            src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/07\/Screenshot-2025-07-29-at-10.40.55\u202fAM.png\"\n            alt=\"BFS Queue\"\n        \/>\n\n        <pre>\nqueue = [       ]\n<strong>FIFO<\/strong> (as queue uses LIFO)\ncurr = q.shift()\npush children and repeat\n\nans = [A, B, C, D, E, F]\n<\/pre\n        >\n    <\/div>\n<\/div>\n\n","protected":false},"excerpt":{"rendered":"<p>DFS and BFS in Binary Tree: DFS: Depth First Search DFS explores a tree by going as deep as possible along a branch before backtracking. BFS: Breadth First Search Explore the tree level by level, explore all nodes at the current level before moving deeper. DFS vs BFS DFS: Preorder: A B D E C<\/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,176,175,211,811,810,174,172,173],"tags":[],"class_list":{"0":"post-8395","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-algorithms","7":"category-algorithms-and-data-structures","8":"category-csharp","9":"category-cplusplus","10":"category-data-structures","11":"category-data-structures-and-algorithms","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\/8395","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=8395"}],"version-history":[{"count":2,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/8395\/revisions"}],"predecessor-version":[{"id":8403,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/8395\/revisions\/8403"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=8395"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=8395"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=8395"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}