A quick and practical guide to getting a path from a root to a node in a binary tree.
Also find me here:
Baeldung Author
Said Sryheni
I have a master's degree in software engineering. Currently, I'm working as a full-stack developer with +6 years of experience. I like algorithms and data structures, in addition to solving complex problems by writing clean and reliable code.
Here's what I've written (so far):
Baeldung on Computer Science
- All
- Algorithms (30)
- Math and Logic (11)
- Searching (9)
- Path Finding (9)
- Graphs (8)
- Trees (7)
- Graph Traversal (7)
- Data Structures (7)
- Sorting (6)
- Programming (2)
- Networking (1)
- Core Concepts (1)
Palindromic Substrings in O(n) with Manacher’s Algorithm
Filed under Searching
A quick and practical overview of Manacher’s algorithm.
Finding All Overlapping Intervals
Filed under Algorithms
A quick and practical guide to detecting overlapping intervals.
Maximum Single-Sell Profit
Filed under Math and Logic
A quick and practical tutorial to finding the Maximum single-sell profit in an array.
Find All Simple Paths Between Two Vertices in a Graph
Filed under Path Finding
A quick and practical tutorial to finding all simple paths between vertices in graphs.
Determine Whether Two Nodes in a Graph Are Connected
Filed under Algorithms, Graphs
A quick and practical tutorial to determining if two nodes are connected or not.
Choosing the Subarray That Adds Up to a Target Number
Filed under Algorithms
A quick and practical guide to choosing the subarray that adds up to a target number.
Finding the Kth Smallest Element in the Union of Two Sorted Arrays
A quick and practical overview of finding the kth smallest element in the union of two sorted arrays.
Find the Subset of Numbers That Add Closest to Target Number
Filed under Algorithms
A quick and practical tutorial to finding the subset of numbers that add up the closest to a target number without exceeding it