A quick and practical guide to creating balanced BST from a sorted list.
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)
Overview of Rabin-Karp Algorithm
Filed under Searching
A quick and practical overview of Rabin-Karp Algorithm.
Finding XOR of All Numbers in a Given Range
Filed under Math and Logic
A quick and practical guide to finding XOR of all numbers in a given range.
Implementing the Decrease-Key Operation for Min-Heaps
Filed under Algorithms, Data Structures
A quick and practical overview of Decrease-Key operations for Min-Heaps.
Lowest Common Ancestor of Two Nodes in a Tree
Filed under Data Structures, Trees
A quick and practical guide to finding the lowest common ancestor of two nodes in trees.
Dijkstra’s vs Bellman-Ford Algorithm
Filed under Path Finding
A quick and practical comparison of Dijkstra’s and Bellman-Ford algorithms.
Sliding Window Algorithm
Filed under Networking
A quick and practical overview of the Sliding Window algorithm.
Kruskal’s vs Prim’s Algorithm
Filed under Graph Traversal, Trees
A quick and practical overview of Kruskal’s and Prim’s algorithms.
Shortest Path to Certain Nodes in a Graph
Filed under Graph Traversal, Graphs
A quick and practical guide to finding the shortest path that visits certain nodes in a weighted graph.