Perform InOrder traversal on a Binary Tree by without Recursion
Question: Given a binary tree root node, perform In Order traversal by using stacks. Example: Consider the image given below: InOrder…
Perform PreOrder traversal on a Binary Tree by without Recursion
Question: Given a binary tree root node, perform PreOrder traversal by using stacks. Example: Consider the image given below: PreOrder…
Display Reverse Level Order Traversal by using queue
Question: Given a binary tree root node, display all the nodes in reverse level order traversal. Example: Consider the image given below: Form…
Display nodes at given level in Binary Tree
Question: Given a binary tree root node and a level, display all the nodes present in that level. Example: Consider the image given below:…
Get Number of Nodes in a Binary Tree
Question: Given a binary tree, get the total number of nodes in it. Example: Consider the image given below: Form the image above, The total…
Get difference between values at Even and Odd level in a binary tree
Question: Given a binary tree, get the difference of the sum of the nodes at odd level and sum of the nodes at even level. Example: Consider…
Given an array, that has zero. Move all the zero at the end, but maintain the relative order of other elements.
Example: array = [3, 4, 0, 5, 6, 0 , 7, 1, 0, 3] Output: [3, 4, 5, 6, 7, 1, 3, 0, 0, 0] The solution is very simple. We take 2 loops. In the…
Given a linked list, check if it is a palindrome or not. Solution in C++
Solution to this problem can be found in 3 steps: 1. First find the middle of the linked list 2. Reverse the linked list from the middle 3.…
C++ program to implement queue using stacks.
So our queue will be having following below functions: my_push(n) This function should insert the element “n” at the end of the queue my_pop()…
You are given a string that contain a basic expression, calculate the result. Solution in C++.
Example: “ 1 + 3” = 4 Multiplication and division signs are not allowed. Only positive and negative numbers are allowed. This problem can be…