#binarytree 検索結果
🌟 Day 222/∞ 🚀 Solved Binary Tree Right Side View 🌳➡️ 🧩 Implemented both BFS (level order traversal) and DFS (right-first recursion) to capture the visible nodes from the right. TC: O(n) | Space: O(h) 💪 #LeetCode #DSA #BinaryTree #BFS #DFS #CodeEveryday #KeepCoding
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 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 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
🗓️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
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)
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
#Day400 of #500DaysOfDSA Topics and Learnings: #BinaryTree Problems Re-revised: 20. #LeetCode #101 : Symmetric Tree Approach: Used #TreeTraversal to solve this Complexiy Analysis: TC: O(N) SC: O(h)
#Day394 of #500DaysOfDSA Topics and Learnings: #BinaryTree, #BreadthFirstSearch Problems Re-revised: 14. #LeetCode #127 : Word Ladder Approach: Used #BreadthFirstSearch to solve this Complexiy Analysis: TC: O(N) SC: O(N)
#Day393 of #500DaysOfDSA Topics and Learnings: #BinaryTree Problems Re-revised: 13. #LeetCode #222 : Count Complete Tree Nodes Approach: Used Height of Left and Right Subtrees to solve this Complexiy Analysis: TC: O(log N * log N) SC: O(log N)
#Day392 of #500DaysOfDSA Topics and Learnings: #BinaryTree, #LevelOrderTraversal Problems Re-revised: 12. #LeetCode #662 : Maximum Width of Binary Tree Approach: Used Level-Order Traversal to solve this Complexiy Analysis: TC: O(N) SC: O(N)
#Day391 of #500DaysOfDSA Topics and Learnings: #BinaryTree, #LevelOrderTraversal Problems Re-revised: 11. #LeetCode #103 : Binary Tree Zigzag Level Order Traversal Approach: Enhancement of #LevelOrderTraversal Complexiy Analysis: TC: O(N) SC: O(N)
#Day381 of #500DaysOfDSA Topics and Learnings: #BinaryTree, #PreOrderTraversal Problems Re-revised: 1. #LeetCode #100 : Same Tree Approach: Traversed both trees together and return false if value doesn't match Complexiy Analysis: TC: O(N) SC: O(h)
🌟 Day 222/∞ 🚀 Solved Binary Tree Right Side View 🌳➡️ 🧩 Implemented both BFS (level order traversal) and DFS (right-first recursion) to capture the visible nodes from the right. TC: O(n) | Space: O(h) 💪 #LeetCode #DSA #BinaryTree #BFS #DFS #CodeEveryday #KeepCoding
🌟 Day 220/∞ 🚀 Solved Binary Tree Level Order Traversal 🌳 🔁 Used BFS with a queue to traverse level by level — capturing each layer’s nodes neatly. Time Complexity: O(n) | Space: O(n) 💪 #LeetCode #DSA #BinaryTree #BFS #Queue #CodeEveryday #KeepCoding
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
✅ 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 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
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
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
🌟 Day 222/∞ 🚀 Solved Binary Tree Right Side View 🌳➡️ 🧩 Implemented both BFS (level order traversal) and DFS (right-first recursion) to capture the visible nodes from the right. TC: O(n) | Space: O(h) 💪 #LeetCode #DSA #BinaryTree #BFS #DFS #CodeEveryday #KeepCoding
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
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
Today solve 2 problems on Leet Code 1.[404] Sum of Left Leaves 2.[112] Path Sum #DSA #binarytree #java #coding #ProblemSolving
✅ 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
#BinaryTree #DSA todays potd: => check balanced tree(if the height difference between the left and right subtrees of every node is at most 1) =>check identical =>check sumtree(root->data=left+right subtrees) with tc of O(n) also revised some queue concepts
#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. #DWTS 41.2K posts
- 2. Northern Lights 15K posts
- 3. Andy 58K posts
- 4. #Aurora 3,354 posts
- 5. Elaine 45.2K posts
- 6. Robert 96.7K posts
- 7. #RHOSLC 4,987 posts
- 8. Dylan 30.1K posts
- 9. #WWENXT 12.8K posts
- 10. Louisville 10.8K posts
- 11. Whitney 8,310 posts
- 12. Alix 8,870 posts
- 13. Kentucky 21.1K posts
- 14. Kam Williams N/A
- 15. Xochitl 3,215 posts
- 16. Meredith 3,391 posts
- 17. #DancingWithTheStars N/A
- 18. Carrie Ann 1,672 posts
- 19. Oweh 1,117 posts
- 20. Pope 25.2K posts