Explore tweets tagged as #binarytree
✅ Today, 16 Nov 2025 💎 Learned & solved key Greedy Algorithm problems: Chocolas problem,Job Sequencing,Activity Selection,Indian Coins, Fractional Knapsack, Minimum Difference,Lambda functions & more greedy Qs 💎 Started Binary Trees 🌳 #100DaysOfCode #DSA #Greedy #BinaryTree
0
0
3
Day 65 of #100DaysOfDSA Learned Preorder Traversal (Iterative) using a stack Traversal order: Root → Left → Right Pushing right first, then left ensures the correct order 🪄 Few lines of code, but pure logic magic #DSA #LeetCode #JavaScript #Coding #BinaryTree
0
0
15
Day 157 – DSA Journey 🚀 Today I learned some interesting binary tree traversal techniques: • Vertical Order • Diagonal Order • Tree Boundary Each added new insight into visualizing and processing trees. 🌳 #DSA #BinaryTree #LeetCode #GeeksforGeeks #CodingJourney
0
0
5
Day 74 of DSA 🌳 Solved the Balanced Binary Tree problem today. Learned how to check if a binary tree is height-balanced using a bottom-up DFS approach — efficient and elegant! 💡 #100DaysOfCode #DSA #BinaryTree
0
0
3
Day 64 of DSA 🌳 Today I learned Preorder, Inorder, and Postorder Tree Traversals using recursion. It’s amazing how just a few lines of code can perform such magical operations on a tree — absolutely mind-blowing! ⚡🔥 #DSA #BinaryTree #Recursion #CodingJourney #100DaysOfCode
0
0
3
🌳 Day 77 of #100DaysOfCode Today I solved: ✅ Maximum Width of Binary Tree 🔹 Practiced level-order traversal while keeping track of indices to calculate the maximum width. 🔹 Strengthened concepts of BFS and handling large index values in trees. #DSA #LeetCode #BinaryTree
0
0
4
Day 29 #LeetCode75 Problem: 236. Lowest Common Ancestor Idea: Find the deepest node that’s ancestor of both p & q Return NULL if node is NULL. Return node if it’s p or q. Explore left & right. If both return non-NULL → current node is LCA. #DSA #BinaryTree #CodingJourney #MIET
0
0
12
Day 31 of #LeetCode75 Problem: 1161.Maximum Level Sum Binary Tree Approach: Use Level Order Traversal (BFS) with a queue. Update the result when a higher sum is found. TimeO(n) Spac:O(n) #LeetCode #75DaysChallenge #Day31 #BinaryTree #BFS #DSA #CPlusPlus #CodingJourney #cpp
0
0
19
🗓️Day 77/100 #100DaysOfCode with @GeeksforGeeks 🚀 #BinaryTree in #DSA ✅Type of Trees ✅Introduction to Binary Tree ✅Types of Binary Tree #MongoDB in #WebDev ✅Revised 🔗Course Link: https://t.co/yEOdje9YEE
#skillupwithgfg #nationskillup #100DaysOfDSA #geeksforgeeks #gfg
0
0
15
🗓️Day 83/100 #100DaysOfCode with @GeeksforGeeks 🚀 #MongDB in #WebDev ✅Caching & Optimisation #BinaryTree in #DSA ✅Mirror Tree (Using Recursion & Iteration) ✅Vertical Tree Traversal 🔗Course Link: https://t.co/yEOdje9qP6
#skillupwithgfg #nationskillup #100DaysOfDSA #gfg
1
0
19
🌳 Day 155 - #DSA Today I learned iterative tree traversals: • Preorder. • Inorder. • Postorder. Shifting from recursion to iteration gave me a deeper understanding of stack-based tree processing. 🚀 #DSA #BinaryTree #100DaysOfCode #ProblemSolving
0
0
14
🌳 Day 83 of #100DaysOfCode Solved Lowest Common Ancestor in Binary Tree 🌲 — solidified recursion & divide-conquer logic! ✅ Web Dev revision for upcoming exams 📚 Studied for entrance coaching 🧩 Solved a mock test to find weak areas #DSA #CPlusPlus #BinaryTree #WebDev
0
0
3
Day 159 – DSA Journey 🌳 Today I tackled: • 🔥 Burning Tree • 🌳 Max Path Sum Between Two Nodes Both deepened my grasp of recursion and tree traversal — powerful tools for complex problems! 💡 #BinaryTree #Algorithms #Coding #DataStructures #LearningJourney
1
0
6
🔥 Day 393 of #geekstreak2025 ✅ GFG POTD: Postorder Traversal 🌳 Simple recursive DFS visited left, then right, and finally the root to collect nodes in postorder fashion. #gfg #dsa #binarytree #recursion #geekstreak
0
0
2
Day 30 of #LeetCode75 Problem: 199 Approach: Use DFS. traverse the right subtree first, then the left. If we enter a new level for the first time, record that node’s value. Time:O(n) Space:O(h) #LeetCode #75DaysChallenge #Day30 #DSA #BinaryTree #CodingJourney #KeepLearning
1
0
13
🧠 GFG Problem — Postorder Traversal ⏱️ Solved in: 4 mins 💡 Approach: Recursive Traversal (Left → Right → Node) ⏳ Time Complexity: O(n) 💾 Space Complexity: O(n) (recursion stack) #gfg160 #GFG #DSA #BinaryTree #PostorderTraversal #100DaysOfCode #Coding
2
0
10
Day 32 Of #leetcode75 Problem :450.delete node in a binary search tree. #LeetCode #75DaysChallenge #Day31 #BinaryTree #BFS #DSA #CPl
1
0
20
🗓️Day 79/100 #100DaysOfCode with @GeeksforGeeks 🚀 #Mongoose in #WebDev ✅Queries ✅Populate() Method ✅Virtuals #BinaryTree in #DSA ✅Identical ✅Height/Maximum Depth ✅Balanced ✅Diameter 🔗Course Link: https://t.co/yEOdje9YEE
#skillupwithgfg #nationskillup #geeksforgeeks
2
0
19
Day 27 of #LeetCode75 Problem: 872. Leaf-Similar Trees Approach: Use DFS to store all leaf values of each tree. Compare both vectors at the end. Time:O(n) Space:O(n) #LeetCode #75DaysChallenge #Day27 #DSA #BinaryTree #Recursion #CPlusPlus #CodingJourney #KeepCoding
2
0
25