Click here to see the problem in LeetCode. Read the description carefully. This one is a pretty easy problem for you if you know how to search on Binary Search Tree (BST). First, we will be given a Binary Search Tree and a value for search. We have to search for the given value in […]

# Tag: Tree

## (Pre|In|Post)Order Traversal In Binary Tree | Recursive Way | Code Snippet

Tree traversal algorithms are easy. Let’s see the Python implementation of these three types of tree traversal in the recursive way. Click here to see the iterative implementation of tree traversals. TreeNode Class Pre Order Traversal In Order Traversal Post Order Traversal

## 4 Types Of Binary Tree Traversal | Algorithm Implementation | Iterative Way | Code Snippet

The tree is one of the most important data structures in computer science. We are going to see the Python implementation of tree traversals. In this blog, we will see only iterative implementation. Pre Order Traversal In Order Traversal Post Order Traversal Level Order Traversal

## 404. Sum Of Left Leaves | LeetCode | Python | Solution

This problem description is pretty simple. The description is: find the sum of all left leaves in a given binary tree. Here is the link of the problem. Let’s see the tree from the example. We see a binary tree in the above example. In a binary tree, each node has at most two child […]