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

Zaryab_005's tweet image. 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 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

Zaryab_005's tweet image. 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 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

amanhaidry's tweet image. 🗓️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
amanhaidry's tweet image. 🗓️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
amanhaidry's tweet image. 🗓️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
amanhaidry's tweet image. 🗓️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 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

amanhaidry's tweet image. 🗓️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
amanhaidry's tweet image. 🗓️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
amanhaidry's tweet image. 🗓️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
amanhaidry's tweet image. 🗓️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 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

ANNISH_SEN's tweet image. 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
ANNISH_SEN's tweet image. 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

#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)

esbi2049's tweet image. #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)
esbi2049's tweet image. #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 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

B_Furqan07's tweet image. ✅ 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

Day 87 of #100DaysOfCode I resumed my DSA journey after college! Implemented Tree Traversals on a Binary Tree: Preorder, Inorder, Postorder, Level Order traversal Pushed the code to GitHub. Did less due to college work, but more to come tomorrow! #Cplusplus #BinaryTree #DSA

iamaditya_3's tweet image. Day 87 of #100DaysOfCode 

I resumed my DSA journey after college!
Implemented Tree Traversals on a Binary Tree:
Preorder, Inorder, Postorder, Level Order traversal
Pushed the code to GitHub.

Did less due to college work, but more to come tomorrow!

#Cplusplus #BinaryTree #DSA

✅ Day 143 – Tree Traversals Solved: Preorder (LC 144) Inorder (LC 94) Postorder (LC 145) Mastered recursive DFS & traversal logic 💡 🧪 All test cases passed ✅ #100DaysOfCode #LeetCode #BinaryTree

B_Furqan07's tweet image. ✅ Day 143 – Tree Traversals
Solved:
Preorder (LC 144)
Inorder (LC 94)
Postorder (LC 145)
Mastered recursive DFS & traversal logic 💡
🧪 All test cases passed ✅
#100DaysOfCode #LeetCode #BinaryTree

✅ 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

B_Furqan07's tweet image. ✅ 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

✅ Day 144 – Binary Tree Level Order Traversal Solved: Level Order Traversal (LC 102) Mastered BFS using queue & level-wise traversal 🌲 🧪 All test cases passed ✅ #100DaysOfCode #LeetCode #BinaryTree

B_Furqan07's tweet image. ✅ Day 144 – Binary Tree Level Order Traversal
Solved:
Level Order Traversal (LC 102)
Mastered BFS using queue & level-wise traversal 🌲
🧪 All test cases passed ✅
#100DaysOfCode #LeetCode #BinaryTree

🚀 Solved LeetCode POTD! Built a binary tree from preorder & postorder traversals using recursion + hashing. 🔑 Key Steps: ✅ Preorder for root. ✅ Postorder for subtree boundaries ✅ Recursively build left and right subtrees. #LeetCode #Coding #BinaryTree #Algorithms

im_Himanshu77's tweet image. 🚀 Solved LeetCode POTD!
Built a binary tree from preorder & postorder traversals using recursion + hashing.
🔑 Key Steps:
✅ Preorder for root.
✅ Postorder for subtree boundaries
✅ Recursively build left and right subtrees.
#LeetCode #Coding #BinaryTree #Algorithms

Day 4 – Trees🌳 ✅ Bottom View of Binary Tree ✅ Right/Left View of Binary Tree ✅ Symmetric Binary Tree ✅ Root-to-Node Path in Binary Tree PS: After 2–3 problems I start feeling bored/frustrated Need to fix this. Any suggestions, folks? #coding #DSA #BinaryTree #Developer

sourabhBis51582's tweet image. Day 4 – Trees🌳

✅ Bottom View of Binary Tree
✅ Right/Left View of Binary Tree
✅ Symmetric Binary Tree
✅ Root-to-Node Path in Binary Tree

PS: After 2–3 problems I start feeling bored/frustrated  Need to fix this. Any suggestions, folks?

 #coding #DSA #BinaryTree #Developer
sourabhBis51582's tweet image. Day 4 – Trees🌳

✅ Bottom View of Binary Tree
✅ Right/Left View of Binary Tree
✅ Symmetric Binary Tree
✅ Root-to-Node Path in Binary Tree

PS: After 2–3 problems I start feeling bored/frustrated  Need to fix this. Any suggestions, folks?

 #coding #DSA #BinaryTree #Developer
sourabhBis51582's tweet image. Day 4 – Trees🌳

✅ Bottom View of Binary Tree
✅ Right/Left View of Binary Tree
✅ Symmetric Binary Tree
✅ Root-to-Node Path in Binary Tree

PS: After 2–3 problems I start feeling bored/frustrated  Need to fix this. Any suggestions, folks?

 #coding #DSA #BinaryTree #Developer

Day 87 of #geekstreak2024 🔹 Max Path Sum (Any Node to Any Node) 🔹 Approach: Recursively compute max sum at each node, considering left & right subtrees. 🔹 TC: O(N), SC: O(H) #gfg160 #BinaryTree #DSA

khushalmajoka's tweet image. Day 87 of #geekstreak2024

🔹 Max Path Sum (Any Node to Any Node)
🔹 Approach: Recursively compute max sum at each node, considering left & right subtrees.
🔹 TC: O(N), SC: O(H)
#gfg160 #BinaryTree #DSA

✅Revised Level Order Traversal on @geeksforgeeks 🌿 👨‍💻Clean logic, calm mind, steady progress ✨ #DSA #GFG #BinaryTree #CodingJourney #100DaysOfCode

RahulDas242007's tweet image. ✅Revised Level Order Traversal on @geeksforgeeks  🌿
👨‍💻Clean logic, calm mind, steady progress ✨

#DSA #GFG #BinaryTree #CodingJourney #100DaysOfCode

Check out this study on bias in weighted least absolute deviation estimation for BAR(1) models—commonly used in #BinaryTree data such as cell lineage analyses. 📉Authors introduce two bootstrap-based bias-corrected estimators, which greatly reduce bias 📖 brnw.ch/21wXFCr

Stats_MDPI's tweet image. Check out this study on bias in weighted least absolute deviation estimation for BAR(1) models—commonly used in #BinaryTree data such as cell lineage analyses.
📉Authors introduce two bootstrap-based bias-corrected estimators, which greatly reduce bias
📖 brnw.ch/21wXFCr

Today I solved - Binary Tree Preorder Traversal #tree #binarytree #LeetCode #Java #100daysofjava

chiya_pandey's tweet image. Today I solved - Binary Tree Preorder Traversal 
#tree #binarytree #LeetCode #Java #100daysofjava

Today's Learning 🌱 Revising Binary Trees – Take U Forward (TUF) #DSA #BinaryTree #Striver #TakeUForward #CodingJourney

chiya_pandey's tweet image. Today's Learning 🌱
Revising Binary Trees – Take U Forward (TUF)
#DSA #BinaryTree #Striver #TakeUForward #CodingJourney

Ever wondered what a binary tree looks like from the right side? 🌳 Here’s how to solve LeetCode 199 – Binary Tree Right Side View using DFS in C++! 🎥 Watch now 👉 youtu.be/a3IiFVr-15A #LeetCode #Cplusplus #BinaryTree #CodingInterview #LANAcademy

SolutionsLan's tweet image. Ever wondered what a binary tree looks like from the right side? 🌳
Here’s how to solve LeetCode 199 – Binary Tree Right Side View using DFS in C++!
🎥 Watch now 👉 youtu.be/a3IiFVr-15A
#LeetCode #Cplusplus #BinaryTree #CodingInterview #LANAcademy

Two binary trees — same or not? Most people guess wrong the first time 👀 Watch this step-by-step C++ explanation and see how recursion solves it cleanly. 🎥 youtu.be/OUmBf10UDLA #LeetCode #Cplusplus #BinaryTree #CodingInterview #LANAcademy #learnprogramming

SolutionsLan's tweet card. Are These Trees the Same? 🌿 | LeetCode 872 in C++

youtube.com

YouTube

Are These Trees the Same? 🌿 | LeetCode 872 in C++


🌟 Day 225/∞ 🚀 Solved Count Complete Tree Nodes 🌳🔢 💡 Used DFS for basic counting and an optimized binary search + height check approach for complete trees. Time Complexity: O((log n)²) | Space: O(h) ⚡ #LeetCode #DSA #BinaryTree #BinarySearch #DFS #CodeEveryday #KeepCoding

gauravmawari18's tweet image. 🌟 Day 225/∞ 🚀
Solved Count Complete Tree Nodes 🌳🔢
💡 Used DFS for basic counting and an optimized binary search + height check approach for complete trees.
Time Complexity: O((log n)²) | Space: O(h) ⚡

#LeetCode #DSA #BinaryTree #BinarySearch #DFS #CodeEveryday #KeepCoding

🗓️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

amanhaidry's tweet image. 🗓️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
amanhaidry's tweet image. 🗓️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
amanhaidry's tweet image. 🗓️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
amanhaidry's tweet image. 🗓️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

Zaryab_005's tweet image. 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 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

Zaryab_005's tweet image. 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

amanhaidry's tweet image. 🗓️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
amanhaidry's tweet image. 🗓️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
amanhaidry's tweet image. 🗓️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
amanhaidry's tweet image. 🗓️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

#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

esbi2049's tweet image. #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
esbi2049's tweet image. #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
esbi2049's tweet image. #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

amrit_xrajput's tweet image. #Day176/365
From @striver_79’s A2Z Sheet 🌳

1️⃣ Serialize and Deserialize Binary Tree

#DSA #BinaryTree

Day 275 of #LeetCode: Cousins in Binary Tree II 🌳👨‍👩‍👧‍👦. Learning something new each day through these binary tree challenges! #LeetCodeChallenge #BinaryTree #Coding

Prithvi00211510's tweet image. Day 275 of #LeetCode: Cousins in Binary Tree II 🌳👨‍👩‍👧‍👦. Learning something new each day through these binary tree challenges! #LeetCodeChallenge #BinaryTree #Coding

Day 274 of #LeetCode: Kth Largest Sum in a Binary Tree 🌳📊. Pushing through every challenge, one day at a time! #LeetCodeChallenge #BinaryTree #Coding

Prithvi00211510's tweet image. Day 274 of #LeetCode: Kth Largest Sum in a Binary Tree 🌳📊. Pushing through every challenge, one day at a time! #LeetCodeChallenge #BinaryTree #Coding

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

ANNISH_SEN's tweet image. 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
ANNISH_SEN's tweet image. 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 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

B_Furqan07's tweet image. ✅ 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

Day 85 of #geekstreak2024 🔹 Inorder Traversal 🔹 Approach: Recursion 🔹 TC: O(N), SC: O(N) (Aux Stack) 🔹 Left → Root → Right #gfg160 #BinaryTree #DSA

khushalmajoka's tweet image. Day 85 of #geekstreak2024

🔹 Inorder Traversal
🔹 Approach: Recursion
🔹 TC: O(N), SC: O(N) (Aux Stack)
🔹 Left → Root → Right

#gfg160 #BinaryTree #DSA

Day 86 of #geekstreak2024 🔹 Tree Boundary Traversal 🔹 Steps: Left Boundary → Leaves → Reverse Right Boundary 🔹 TC: O(N), SC: O(N) #gfg160 #BinaryTree #DSA

khushalmajoka's tweet image. Day 86 of #geekstreak2024

🔹 Tree Boundary Traversal
🔹 Steps: Left Boundary → Leaves → Reverse Right Boundary
🔹 TC: O(N), SC: O(N)

#gfg160 #BinaryTree #DSA

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

gautamop01's tweet image. 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

✅ Day 143 – Tree Traversals Solved: Preorder (LC 144) Inorder (LC 94) Postorder (LC 145) Mastered recursive DFS & traversal logic 💡 🧪 All test cases passed ✅ #100DaysOfCode #LeetCode #BinaryTree

B_Furqan07's tweet image. ✅ Day 143 – Tree Traversals
Solved:
Preorder (LC 144)
Inorder (LC 94)
Postorder (LC 145)
Mastered recursive DFS & traversal logic 💡
🧪 All test cases passed ✅
#100DaysOfCode #LeetCode #BinaryTree

#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)

esbi2049's tweet image. #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)
esbi2049's tweet image. #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

cha84587's tweet image. Today solve 2 problems on Leet Code  

1.[404] Sum of Left Leaves
2.[112] Path Sum

#DSA #binarytree #java #coding #ProblemSolving
cha84587's tweet image. 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

B_Furqan07's tweet image. ✅ 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

Loading...

Something went wrong.


Something went wrong.


United States Trends