Print All Nodes Between Two Given Levels

Objective: Given a binary Tree and two levels, Print all the nodes between those.

Input: A Binary Tree and two levels.

Output: Print all the nodes between given levels.

Example:

Approach:

• The solution of this problem is very simple, Do level order traversal and in recursive calls first add the right child and then left child.
• Take a global variable say, currLevel which will store the current level while doing Level Order traversal.
• Print only nodes between given levels.

Read this solution " Level Order Traversal, Print each level in separate line" and implement the above approach.

Also Read:

- Check If One Binary is Mirror Tree of another Binary Tree. Beginner
- Print all subarrays of a given array Medium
- Find a peak element in a Given Array Beginner
- Find whether a Given Binary Tree is Balanced? Medium
- Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node Hard
- Backtracking - Rat In A Maze Puzzle Hard
- Given two binary trees, check if one binary tree is a subtree of another Medium
- Minimum No of operations required to convert a given number to 1 - Integer Replacement Problem. Medium