Algorithm: Binary Tree Right Side View in Swift

Binary Tree Right Side View problem solved image example

Hallo vrienden, Leo hier. The Leetcode problem we will solve today is called Binary Tree Right Side View. We will explore a binary tree problem. Binary tree problems usually are down to two main approaches, breadth-first search, and depth-first search, which are BFS and DFS respectively. In our case, we will use BFS, because it […]

Merge Two Binary Trees In Swift

Merge Two Binary Trees In Swift example

Hoi vrienden, Leo hier. The topic today is how to merge two binary trees in Swift and why you should learn that amazing algorithm. Today we will solve this algorithm question that uses binary trees and recursion to achieve a really nice solution. Trees algorithms usually use recursion because it’s easier to reason about it, […]

Tree Pruning Algorithm in Swift

Tree Pruning Algorithm in Swift example

Hello passionate coders, Leo here. The topic that we will study today is the binary Tree Pruning Algorithm in Swift. We’ll continue the Algorithms series here. The algorithm involves binary tree data structure and some recursion, stay here to explore this challenge. The problem statement you can find and test at the awesome Leetcode site. This […]

Algorithms: Find the Symmetric Difference in Swift

Hey guys Leo here, Today we will start a series in this blog called: Algorithms, the Final Frontier. We’ll follow the interview prep series from the free code camp. The first challenge: Challenge Here The problem: Given two sets (for example set A = {1, 2, 3} and set B = {2, 3, 4}), the mathematical […]