If you know about the level order traversal algorithm, finding the right-side view of a binary tree becomes easy for you. This problem is nothing but...
Continue reading...Binary Tree
Binary Search Tree | Data Structure
Before getting into the Binary Search Tree (BST), you have to know the basics of Tree and Binary Tree. I assume that you have the basic...
Continue reading...Same Tree | LeetCode 100 | Python | Solution
LeetCode 100 It’s an easy LeetCode problem, and the description is concise and straightforward. We can solve this problem using the DFS algorithm. From two binary...
Continue reading...Kth Smallest Element in a BST | LeetCode 230 | Python | Solution
LeetCode 230 I hope you already know about Binary Search Tree. In BST, each node is greater than its left subtree and smaller than its right...
Continue reading...Binary Tree Level Order Traversal | LeetCode 102 | Python | Solution
LeetCode 102 This problem just simply the implementation of the level order traversal algorithm. If you don’t know about level order traversal yet, you can check...
Continue reading...Maximum Depth of Binary Tree | LeetCode 104 | Python | Solution
LeetCode 104 It’s a common and basic type of problem. The problem title is self-explanatory. We all know about a binary tree. To solve this problem,...
Continue reading...Level Order Traversal – BFS Algorithm
This one is another way of traversing through a binary tree. There are many other ways you can do it. Click here to check. Level order...
Continue reading...Binary Tree Traversal Algorithms | DFS | Algorithm
There are three Depth First Search (DFS) types of traversal algorithms for Binary Tree. Traversal algorithms are for traversing in a Binary Tree. These three are...
Continue reading...Binary Tree | Data Structure
I have written a blog about the tree data structure overview. If you don’t know about tree data structure, click here to see my blog. In...
Continue reading...Insert into a Binary Search Tree | LeetCode 701 | Python | Solution
Click here to see the problem details. Read the problem details first. Concept This is clearly a Tree related problem and a medium-type problem. In my...
Continue reading...