178. Search the Element in a binary tree - With and Without Recursion

Objective: Given a binary tree and a given number x, Write a recursive algorithm to search the element in the tree.

This is one of the very basic problems of trees. If you are new to binary trees, this problem might help you to understand the tree. First, we will see the recursive solution and then we will solve it without recursion.

Approach:

Recursive Approach:

The approach will be quite simple, do any of the tree traversals(inorder, preorder, postorder, BFS or DFS) and check if the given element is present.

Does 4 exist in the tree: true
Does 7 exist in the tree: false

Non-Recursive Approach:

1. If we are not using recursion then we need a data structure to store the tree traversal, we will use a queue here
2. Add root to the queue
3. Check if the current node has the element we are looking for if yes then return true else add children nodes of the current node to the queue
4. If the queue gets empty, which means we have not found the element

Output:

Does 4 exist in the tree: true
Does 7 exist in the tree: false

Related Problems:

- Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium
- Verifying Mirror Binary Trees Beginner
- Find and Print Full Nodes in a Binary Tree Beginner
- Find and Print Full Nodes in a Binary Tree Beginner
- Binary Tree-Postorder Traversal - Non Recursive Approach Beginner