Given a binary tree, find the maximum element in it. In this tutorial, we are going to write a code to find the maximum element in a binary tree without using recursion.
For example:
In this binary tree, the maximum element is 9.
Given a binary tree, we have to write a code to print the right view of a binary tree.
The right view of a binary tree is the set of visible nodes when it is visited or seen from the right side.
For example:
Example 1:
Let’s take an example. In this binary tree, the node which is visible from the right side is 1, 3, 4, and 8.
Find triplets with zero sum (3Sum Problem). Given an array of integers, write a code to find all unique triplets in the array which gives the sum of zero.
Note: The solution set must not contain duplicate triplets.
For example –
Example 1:
Input: {-1, 0, 1, 2, -1, -4}
Output: {-1, 0, 1}, {-1, -1, 2}
Example 2:
Input: {-8, -7, 5, 2}
Output: {-7, 5, 2}