Day 10 of #SDESheetChallenge ✅ Today I solved: ✅ Morris Inorder Traversal ✅ Morris Preorder Traversal Back to DSA after a few busy days. @striver_79 @takeUforward_ #DSA #LeetCode #BinaryTree

Day 86 of #100DaysOfCode 🚀 Solved LeetCode 1038: Binary Search Tree to Greater Sum Tree ✅ Used Reverse Inorder Traversal Running Sum to update each BST node with the sum of greater values ⏱ Time: O(n) 💾 Space: O(h) #LeetCode #DSA #Java #BST #BinaryTree #Recursion

Day 85 of #100DaysOfCode 🚀 Solved LeetCode 1302: Deepest Leaves Sum ✅ Used Recursion Depth Calculation to find the deepest level and sum all leaf nodes 🌳 ⏱ Time: O(n) 💾 Space: O(h) #LeetCode #DSA #Java #BinaryTree #Recursion #CodingJourney #100DaysOfCode

Day 84 of #100DaysOfCode 🚀 Solved LeetCode 1382: Balance a Binary Search Tree ✅ Used Inorder Traversal Divide & Conquer to rebuild a balanced BST 🌳 ⏱ Time: O(n) 💾 Space: O(n) #LeetCode #DSA #BinaryTree #Recursion

Day 9 of #SDESheetChallenge ✅ Started the Binary Trees section today. 🌳 Solved: ✅ Inorder Traversal ✅ Preorder Traversal ✅ Postorder Traversal @striver_79 @takeUforward_ #DSA #LeetCode #BinaryTree

Traversal methods in Binary Trees: • Inorder (Left → Root → Right) • Preorder (Root → Left → Right) • Postorder (Left → Right → Root) Understanding these three traversals is the foundation of tree problems in DSA. 🌳 #DSA #Coding #CPP #BinaryTree

Day 82 of #100DaysOfCode 🚀 Solved LeetCode 98: Validate Binary Search Tree ✅ Used DFS Min/Max Range Validation to verify BST properties 🌳 ⏱ Time: O(n) 💾 Space: O(h) #LeetCode #DSA #Java #BST #BinaryTree #DFS #CodingJourney

Day 102 — Binary Tree traversals done! Preorder, Inorder, Postorder — all O(n). Recursion mirrors the tree's own structure 🤯 Also — Happy Birthday @rohit_negi9 Sir! 🎂🎉 Best mentor one could ask for 🙏 #CoderArmy #180DaysDSAChallenge #BinaryTree #LearningInPublic

Day 81 of #100DaysOfCode 🚀 Solved LeetCode 235: Lowest Common Ancestor of a Binary Search Tree ✅ Used BST properties to locate the split point between two nodes 🌳 ⏱ Time: O(h) 💾 Space: O(1) The first node where paths diverge = LCA 🔥 #LeetCode #DSA #Java #BST #BinaryTree

#Day45 of #LeetCode75 🚀 Q1g 💡 Track max value from root → node If current ≥ max_so_far → good node ⚙️ DFS state passing ⏱️ O(n) | 📦 O(h) Small insight, big impact 💯 #LeetCode #DSA #BinaryTree @sheryians_ @ali_In_bits

Day 101 — Trees unlocked! 🌳 → Hierarchical structure with nodes & edges → Key terms: root, leaf, height, degree, siblings → Binary Tree → n nodes = n-1 edges → Built tree from input using Queue @rohit_negi9 sir! #CoderArmy #DSA #Trees #BinaryTree #LearningInPublic

Day 80 of #100DaysOfCode🚀 Solved LeetCode 701: Insert into a Binary Search Tree✅ Used Recursive BST Insertion to place the new node efficiently🌳 ⏱ Time: O(h) 💾 Space: O(h) Follow BST ordering and insertion becomes natural🔥 #LeetCode #DSA #Java #BST #BinaryTree #Recursion

If Binary Trees still confuse you, don't worry. Every advanced tree problem is built on a few simple concepts. Master the fundamentals first. The rest becomes much easier. 🌳 #BinaryTree #DSA #CodingInterview #Programming

Day 77 of #100DaysOfCode 🚀 Solved LeetCode 108: Convert Sorted Array to Binary Search Tree ✅ Used Divide & Conquer Recursion to build a height-balanced BST 🌳 ⏱ Time: O(n) 💾 Space: O(log n) #LeetCode #DSA #Java #BST #BinaryTree #Recursion #CodingJourney

🎊 624 Days of @geeksforgeeks #potd 🚀 Vertical Sum in Binary Tree 🌳 ✅ Solved using: 🔹 BFS with Queue & Horizontal Distance 🔹 DFS with Recursion & Map #JavaScript #BinaryTree #geeksforgeeks #DSA

you should be able to solve a business problem import binaryTreeReverser from 'stdlib' binaryTreeReverser.reverse(binaryTree)

Day 71 of #100DaysOfCode🚀 Solved LeetCode 110: Balanced Binary Tree ✅ Used DFS Recursion — height() returns -1 for unbalanced subtrees 🌳 ⏱ Time: O(n) 💾 Space: O(h) one pass to rule them all! #LeetCode #DSA #Java #BinaryTree #DFS #CodingJourney

Day 69 of #100DaysOfCode 🚀 Solved LeetCode 257: Binary Tree Paths ✅ Used DFS Recursion to build all root-to-leaf paths 🌳 ⏱ Time: O(n²) 💾 Space: O(h) Path building through recursion = simple and elegant 🔥 #LeetCode #DSA #Java #BinaryTree #DFS #CodingJourney

Day 14 of #100DaysOfCode 🚀 Today I learned about Binary Trees and how to convert an array into a Binary Tree. 🌳 ✅ Understood the basic structure of a Binary Tree ✅ Learned how nodes are connected using left and right child pointers ✅ Practiced constructing a Binary Tree from an array representation Slowly building a strong foundation in DSA, one day at a time. 💪 #100DaysOfCode #DSA #BinaryTree #Cpp #Programming #CodingJourney #SoftwareDevelopment

Day 68 of #100DaysOfCode 🚀 Solved LeetCode 102: Binary Tree Level Order Traversal ✅ Used BFS Queue to traverse tree level by level 🌳 ⏱ Time: O(n) 💾 Space: O(n) Level-wise traversal done cleanly using queue 🔥 #LeetCode #DSA #Java #BinaryTree #BFS #CodingJourney