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 a simple extended version of that. If you want to know about Level Order Traversal, I will encourage you to read this blog. LeetCode 199 The problem description is […]
LeetCode 199 | Binary Tree Right Side View | Python | Solution Read More »
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 idea of Tree and Binary Tree. Intro A Binary Search Tree is a special type of Binary Tree with some extra conditions. In a binary tree, a node can
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 trees, we have to check whether both are the same or not. Consider the following cases for two different nodes. If both nodes are null, we can say that
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 subtree. If we print all the nodes of a BST using an inorder traversal algorithm, we will get the sorted value in ascending order. Inorder traversal follows the rule:
Kth Smallest Element in a BST | LeetCode 230 | Python | Solution Read More »
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 my blog on this topic. As we know, using level order traversal, we traverse through the tree level by level. But in this problem, we have to separate values
Binary Tree Level Order Traversal | LeetCode 102 | Python | Solution Read More »
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, we have to find the maximum depth of a binary tree. We can solve this using both DFS and BFS algorithms. I am going to use the DFS solution.
Maximum Depth of Binary Tree | LeetCode 104 | Python | Solution Read More »
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 traversal is a binary tree version of the BFS (Breadth-First Search) algorithm. The concept is simple. I hope you already know about the binary tree. If we visualize a
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 variations of the Depth First Search (DFS) algorithm. In DFS, we start traversing from the root and go in-depth until there is no node to traverse. Its uses in
Binary Tree Traversal Algorithms | DFS | Algorithm Read More »
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 this blog, we will be going to know about Binary Tree. I hope you will get some idea of it. A binary tree is a type of tree. But
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 sense, it’s not that difficult if you have a basic concept about BST (Binary Search Tree). BST is also a Binary Tree. So what is a Binary Search Tree?
Insert into a Binary Search Tree | LeetCode 701 | Python | Solution Read More »