Solved: ✔️ Level Order Traversal ✔️ Count Leaf Nodes ✔️ Sum of Binary Tree ✔️ Size of Binary Tree #DSA #BinaryTrees #Cpp #Coding #StudentLife #EngineeringLife #PlacementPrep

Day 159/365 of the DSA grind! Reusing templates and exploiting BST rules today: • Level Order Traversal: The standard BFS Queue boilerplate. • Zigzag Level Order: Same BFS code, just added a boolean flag and Collections.reverse() to flip every other level! • Minimum Absolute Difference: In-order traversal gives sorted order automatically. Tracked a prev pointer to calculate differences on the fly with O(1) space. #DSA #Java #100DaysOfCode #LeetCode #BinaryTrees

Day 158/365 of the DSA grind! Learning the BFS Queue template today! • Lowest Common Ancestor: If a node gets a hit from both its left and right branches, it's the LCA! • Right Side View: Level-order traversal. Just grabbed the last node of every level. • Average of Levels: Same BFS boilerplate, just averaged the level sums! #DSA #Java #100DaysOfCode #LeetCode #BinaryTrees

Day 157/365 of the DSA grind! Exploiting tree structures today! • Binary Tree Max Path Sum (Hard): Used post-order DFS to track global maxes while returning single-path gains. • BST Iterator: Paused an in-order traversal using a Stack for clean O(h) memory! • Count Complete Tree Nodes: Skipped the full traversal. Compared left/right depths and used bitwise shifts (1 << height) for an instant count! #DSA #Java #100DaysOfCode #LeetCode #BinaryTrees

Day 156/365 of the DSA grind! Passing state through trees today! • Flatten Binary Tree: Used a reverse post-order traversal (Right, Left, Root) to rewire the tree in O(1) space! • Path Sum: Subtracted from the target down to the leaves. • Sum Root to Leaf: Shifted decimals dynamically down the stack (current * 10 val). #DSA #Java #100DaysOfCode #LeetCode #BinaryTrees

Day 155/365 of the DSA grind! Building trees and bending pointers today: • Construct Tree (Pre/In): Mapped the inorder array to a HashMap for O(1) root lookups to avoid nested loops! • Construct Tree (In/Post): Same HashMap trick, but working backward from the postorder tail. • Next Right Pointers II: Banned from using a Queue? Used a Dummy Node to link the next level like a Linked List instead #DSA #Java #100DaysOfCode #LeetCode #BinaryTrees

Day 154/365 of the DSA grind! System design patterns and famous tree problems today: • LRU Cache: Paired a HashMap with a custom Doubly Linked List for pure O(1) caching! • Invert Binary Tree: The legendary Google Homebrew problem! Just 3 lines of recursive swapping. • Symmetric Tree: Mirrored recursion checking outer and inner branches. #DSA #Java #100DaysOfCode #LeetCode #BinaryTrees

Day 153/365 of the DSA grind! Hello Binary Trees! • Partition List: Built two separate dummy lists (one for smalls, one for bigs) and stitched them together. • Max Depth of Binary Tree: Trees = recursion! Math.max(left, right) 1. • Same Tree: Clean recursive structural checks. #DSA #Java #100DaysOfCode #LeetCode #BinaryTrees

Day 132/365: DFS vs. BFS Traversals! • Pre-Order (Root, Left, Right | Top-down cloning) • In-Order (Left, Root, Right | Ascending sorts) • Post-Order (Left, Right, Root | Bottom-up processing) • Level-Order (Solved by deploying an iterative Queue for BFS!) #DSA #Java #100DaysOfCode #BinaryTrees

Day 131/365: Welcome to Binary Trees! • Height of Tree (Recursive depth tracking) • Sum of All Nodes (State accumulation via subtrees) • Total Nodes in Tree (O(N) Post-order counting) • Are Trees Identical (Solved by applying synchronous dual-traversal!) #DSA #Java #100DaysOfCode #BinaryTrees

⭐ SO , TODAY IS DAY 2 OF MY B.I.R.T.H.D.A.Y SERIES. ⭐ Today’s progress: 1️⃣Remove Duplicates in Sorted Linked List 2️⃣ Identical Trees 3️⃣ Check if Array is Sorted. #BirthdaySeries #DSA #LeetCode #GeeksForGeeks #Algorithms #DataStructures #BinaryTrees #LinkedList #Arrays #code

🧵 Thread 2️⃣ - Tree Problems Learning Recap 🌳 Day 36/365 🌳 Tree problems today were 🔥 Solved: ✅ Balanced Binary Tree ✅ Diameter of Binary Tree ✅ Maximum Depth of Binary Tree All using DFS recursion. #DSA #BinaryTrees #LeetCode

🚀 Day 18 of #50DaysOfDSA Today’s focus was on how to approach problems that involve multiple concepts together. Sometimes a question isn’t just trees, or maps, or BFS - it’s a mix, and learning how to break it down makes a big difference. 🧩 Problems solved today: ✅ LeetCode 2385. Amount of Time for Binary Tree to Be Infected ✅ LeetCode 49. Group Anagrams #DSA #50DaysOfDSA #Day18 #BinaryTrees #Hashing #LeetCode #ProblemSolving #Consistency #DSAJourney

🚀 Day 15 of #50DaysOfDSA Another day, another concept. Today I learned about: Top View of a Binary Tree This topic helped me understand how vertical ordering works in trees and how maps play a role in storing nodes based on horizontal distance. 🧩 Problem solved today (GFG POTD): ✅ Bus Ticket Change #DSA #50DaysOfDSA #Day15 #BinaryTrees #GFG #POTD #Consistency #Learning #ProblemSolving

• Implemented batch gradient descent symbolically #WomenWhoCode #LeetCode #DSA #BinaryTrees #MachineLearning #Python #SymPy #LearningInPublic #BuildInPublic

Day 75 // DSA Binary Trees.... Covered: Recursive traversals (pre, in, post) Level order traversal Iterative traversals (stack-based) Height, balance check Diameter of a binary tree Move. #DSA #BinaryTrees #LearnInPublic

🗓️Day-148- #365DaysOfCode | @geeksforgeeks #DSA | #BinaryTrees ✅Problem: Tree Boundary Traversal ✅Problem: Top View of Binary Tree #nationskillup #365DaysOfDSA #geeksforgeeks #gfg #365DaysOfcoding #java #DataStructuresAndAlgorithms

Day 87 📚: Binary Trees (Traversal Views & Ancestry) ✅: Lowest Common Ancestor (LCA) Right Side View of Binary Tree My solutions: github.com/MAKX-Dev/Striver-… #100DaysOfCode #DSA #BinaryTrees #Recursion #TUFWinterArc

Day 86 📚: Binary Trees (Path Optimization) ✅: Maximum Path Sum My Solutions : github.com/MAKX-Dev/Striver-… #100DaysOfCode #DSA #BinaryTrees #Recursion #Optimization #TUFWinterArc

Day 85 📚: Binary Trees (Height Balancing Logic) ✅: Check for Balanced Binary Tree My Solutions : github.com/MAKX-Dev/Striver-… #100DaysOfCode #DSA #BinaryTrees #Recursion #TUFWinterArc