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
3
Jun 13
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
1
4
Jun 12
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
1
1
Jun 11
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
1
2
11
Jun 10
Day 9 of #SDESheetChallenge β
Started the Binary Trees section today. π³
Solved:
β
Inorder Traversal
β
Preorder Traversal
β
Postorder Traversal
@striver_79 @takeUforward_
#DSA #LeetCode #BinaryTree
11
Jun 10
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
7
90
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
1
3
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
1
22
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
1
7
Jun 8
#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
6
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
5
35
π» DSA Practice β Day 171
Solved 2196 β Create BT From Descriptionsπ³
This was a really interesting BT PB and it definitely one challenges tests the both problem-solving & implementation skillsπ§ π₯
πleetcode.com/u/Anshv8096/
#LeetCode #DSA #BinaryTree #ProblemSolvingπ
1
4
Day 147/365
Solved LeetCode Q2196 today.
Create Binary Tree From Descriptions.
Building parent-child relationships cleanly was the main challenge.
Nice tree construction problem.
#26meDSAkhatam #buildinpublic #LeetCode #binarytree #datastructures
2
1
45
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
3
45
Jun 7
LeetCode 2196 β Create Binary Tree From Descriptions | Day 158
Hash map to store nodes. Track all children. Root = value not a child. Attach left/right accordingly. O(n).
#LeetCode #BinaryTree #Coding
2
8
Jun 5
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
5
1
8
121
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
1
8
37
π 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
12
121
May 27
you should be able to solve a business problem
import binaryTreeReverser from 'stdlib'
binaryTreeReverser.reverse(binaryTree)
6
215
May 25
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
7
73