#binarytree résultats de recherche
Day 38 of learning DSA. Solved 2 binary tree problems today. Still adapting to the syntax but progressing every single day! 🌳💪 #BinaryTree #KeepLearning
🗓️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: geeksforgeeks.org/nation-skill-u… #skillupwithgfg #nationskillup #100DaysOfDSA #geeksforgeeks #gfg
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
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
Solved two similar-looking but fundamentally different #BinaryTree problems! 1: Largest BST Subtree (by size) 2: LeetCode 1373: Maximum Sum BST in Binary Tree🔍 Key Insight: #100DaysOfCode #LeetCode #Java #DSA
Today 3 Problem solved on Leetcode. 1. Root Equals Sum of Children 2.Even Odd Tree 3. Count Good Nodes in Binary Tree #DSA #BinaryTree #JAVA #DailyCoding #ProblemSolving
#BinaryTree #DSA POTD: minimum time to burn the tree from a given node Approach: =>create a map to track each node's parent =>locate the target node =>From the target node, burn its left, right, and parent then count all levels by boolean var. with complexity of O(n)
Today solve 2 problems on Leet Code 1.[404] Sum of Left Leaves 2.[112] Path Sum #DSA #binarytree #java #coding #ProblemSolving
🗓️Day 85/100 #100DaysOfCode with @GeeksforGeeks 🚀 #BinaryTree ✅Lowest Common Ancestor #binarysearchtree ✅Introduction ✅Insertion ✅Searching ✅Sorted Elements ✅Minimum Element 🔗Course Link: geeksforgeeks.org/nation-skill-u… #skillupwithgfg #nationskillup #DSA #geeksforgeeks #gfg
✅ Day 146 – Diameter of Binary Tree Solved: Diameter of Binary Tree (LC 543) Used DFS with post-order traversal to compute max path length 🔄 Clean logic, passed all cases in 0 ms! 💡 #100DaysOfCode #LeetCode #BinaryTree
✅ LeetCode #104 – Maximum Depth of Binary Tree solved! Step by step getting better every day 🌱 #DSA #LeetCode #BinaryTree #CodingJourney #CodeNewbie #ProblemSolving #JavaScript #100DaysOfCode #ProgrammerLife #CodeWithPurpose #TechGoals #KeepGrinding
Day 39 // DSA + Dev Binary Tree problems Symmetric Binary Tree Top View of Binary Tree Zig Zag Traversal of Binary Tree Maximum path sum #DSA #BinaryTree #ProblemSolving #100DaysOfCode #LearningJourney #CodeEveryday
Day 38 of learning DSA. Solved 2 binary tree problems today. Still adapting to the syntax but progressing every single day! 🌳💪 #BinaryTree #KeepLearning
🌟 Day 216/∞ 🚀 Solved Same Tree 🌳 🧠 Implemented both DFS (recursive) and BFS (iterative) approaches to check structural and value equality of two trees. Time Complexity: O(n) | Space: O(h) 💪 #LeetCode #DSA #BinaryTree #BFS #DFS #CodeEveryday #KeepCoding
✅ Day 127 of #150DaysOfDSA 📍 LC 94: Binary Tree Inorder Traversal Solved using recursion — visited left subtree, root, then right subtree to collect nodes in sorted order. ⏱ O(n) | O(n) #BinaryTree #Recursion #DFS #Java #150DaysOfDSA ✨
🌟 Day 214/∞ 🚀 Solved Invert Binary Tree 🌲 Maximum Depth of Binary Tree 🌳 🧠 Explored both DFS & BFS approaches — recursion for depth-first elegance, and queue for breadth-first clarity. Time Complexity: O(n) | Space: O(h) 💪 #LeetCode #DSA #BinaryTree #BFS #DFS #CodeEveryday
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
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
🗓️Day 85/100 #100DaysOfCode with @GeeksforGeeks 🚀 #BinaryTree ✅Lowest Common Ancestor #binarysearchtree ✅Introduction ✅Insertion ✅Searching ✅Sorted Elements ✅Minimum Element 🔗Course Link: geeksforgeeks.org/nation-skill-u… #skillupwithgfg #nationskillup #DSA #geeksforgeeks #gfg
#Day378 of #400DaysOfDSA Topics and Learnings: #BinaryTree Problems Revised: 201. #LeetCode #101 : Symmetric Tree Approach: Used #TreeTraversal to solve this Complexiy Analysis: TC: O(N) SC: O(h)
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
🗓️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: geeksforgeeks.org/nation-skill-u… #skillupwithgfg #nationskillup #100DaysOfDSA #geeksforgeeks #gfg
Solved two similar-looking but fundamentally different #BinaryTree problems! 1: Largest BST Subtree (by size) 2: LeetCode 1373: Maximum Sum BST in Binary Tree🔍 Key Insight: #100DaysOfCode #LeetCode #Java #DSA
Today solve 3 problems on Leet Code 1. [95] Unique Binary Search Tree 2. [98] Validate Binary Search Tree 3. [129] Sum Root to Leaf Numbers #DSA #binarytree #java #coding #ProblemSolving
🗓️Day 85/100 #100DaysOfCode with @GeeksforGeeks 🚀 #BinaryTree ✅Lowest Common Ancestor #binarysearchtree ✅Introduction ✅Insertion ✅Searching ✅Sorted Elements ✅Minimum Element 🔗Course Link: geeksforgeeks.org/nation-skill-u… #skillupwithgfg #nationskillup #DSA #geeksforgeeks #gfg
Today solve 2 problems on Leet Code 1.[404] Sum of Left Leaves 2.[112] Path Sum #DSA #binarytree #java #coding #ProblemSolving
Day 38 of learning DSA. Solved 2 binary tree problems today. Still adapting to the syntax but progressing every single day! 🌳💪 #BinaryTree #KeepLearning
Today 3 Problem solved on Leetcode. 1. Root Equals Sum of Children 2.Even Odd Tree 3. Count Good Nodes in Binary Tree #DSA #BinaryTree #JAVA #DailyCoding #ProblemSolving
✅ Day 145 – Maximum Depth of Binary Tree Solved: Max Depth of Binary Tree (LC 104) Used BFS to compute tree depth efficiently 🌳 All test cases passed with 0 ms runtime ⚡ #100DaysOfCode #LeetCode #BinaryTree
POD ✅: Root to Leaf Paths – Solved! I had solved this one a long time ago, but revisited it today. Tried 2–3 approaches, including DFS & BFS. Relearned the trade-offs, recursion tricks, and how traversal order affects the output. Feels good to crack it again! #DSA #BinaryTree
#Day176/365 From @striver_79’s A2Z Sheet 🌳 1️⃣ Serialize and Deserialize Binary Tree #DSA #BinaryTree
Something went wrong.
Something went wrong.
United States Trends
- 1. Carson Beck 3,942 posts
- 2. Miami 59K posts
- 3. Jaire 5,000 posts
- 4. Vandy 13K posts
- 5. #UFCVegas110 5,166 posts
- 6. Mario 67.1K posts
- 7. Clemson 11.8K posts
- 8. Howie 2,287 posts
- 9. Lagway 1,889 posts
- 10. Noah Thomas N/A
- 11. Georgia 41.2K posts
- 12. #iufb 1,604 posts
- 13. Ringo 12.9K posts
- 14. Jeff Sims 1,514 posts
- 15. Ohio State 18.1K posts
- 16. Dabo 3,194 posts
- 17. Ethical Diamond N/A
- 18. Adoree N/A
- 19. Iowa State 3,191 posts
- 20. Dumont 1,733 posts