Given the linked list, we need to find the nth node from the end of linked list. The n can be any arbitrary number within the range of number of nodes in linked list. Let us understand our problem statement. Let us take a look into the linked list as shown in Fig 1.
Given the linked list we need to find the centre or middle node. Let us take an example to understand our problem statement.
Given the lined list, we need to print the linked list in reverse order i.e. we need to start printing the linked list from last to first node. Let us take an example to understand the problem statement.
Given the linked list, we need to reverse the linked list. The linked list is shown in Fig 1, the head is location at node 1. Each node in a list have reference to next node in the list. The node 1 will have reference to node 2 and node 2 will have reference to node 3 and so on. The linked list is null terminated or marker for end of linked list.
What is level in binary tree?
Level is distance or hops of node with respect to root node. The root node is considered to be at level 0, so children of root node will be at level 1 (level of root node + 1). So, we can calculate the level of all the nodes in binary tree.
As an example, consider the tree:
Given the binary search tree, we need to find the Ceil value of given input data.
What is Ceil value ? The smallest value just greater than or equal to given input data. We have already discussed about Floor of input data in BST. The logical flow of ceil value in BST is exactly same as that floor value. Let us find Ceil value for BST shown in Fig 1.
Given a binary search tree (BST), find out the floorl value of input data using recursive algorithm. Traverse the binary
Given a binary tree, we need to connect the nodes lying at same level. We have already discussed about the tree traversal using breadth first search algorithm, where we are printing the nodes level by level. By the end of this article we will achieve the same result using next sibling reference. In binary tree, we generally have following information.
Given a binary search tree (bst), we would like to find out K smallest element in BST. Traverse the binary
We are given two binary tree, we need to find out whether one binary tree is Quasi Isomorphic of other binary tree. Quasi Isomorphic tree? Trees are considered to Quasi isomorphic where we concerned about the structures. The structure of both tree either should be identical or obtained by swapping (or Mirror) its children.
What is level in binary tree?
Level is distance or hops of node with respect to root node. The root node is considered to be at level 0, so children of root node will be at level 1 (level of root node + 1). So, we can calculate the level of all the nodes in binary tree.
As an example, consider the tree:
Given the binary tree, We need to find the maximum width of binary tree. What is width of binary tree? The number of nodes at any level provides the width of binary tree (at that level). We will find the width at each level and maximum among these widths will be our desired output.
Lowest or least common ancestor is the earliest possible node where concerned child nodes joined.
Let us take an example tree, we will discuss some examples to clarify the LCA. We have already discussed about finding lowest common ancestor in binary tree (not binary search tree)
What is Binary Search Tree?
The binary search tree is specialized form of binary tree having following properties
Left child of binary tree node is less than its parent node
Right child of binary tree node is greater than its parent node
We are given the node value (or data), we need to find the node in the binary search tree. let us take a example to understand the problem statement.
What is Binary Search Tree?
The binary search tree is specialized form of binary tree having following properties
Left child of binary tree node is less than its parent node
Right child of binary tree node is greater than its parent node
We are given two binary tree, we need to find out whether one binary tree is identical to other binary tree.
We need to check whether
Composition of both binary trees are same
Data of nodes of both binary tree (at respective position) are same
Given the binary tree, There are multiple paths exist from root to leaf nodes. We need to check whether the given number equals the sum of all the nodes for any path. Let us elaborate more on this.
Given the binary tree, There are multiple paths (equal to number of leaf nodes) exist from root to leaf nodes, We need to calculate the sum of all nodes in each root to leaf path, then we need to print the maximum sum and the corresponding path. Let us take the example to elaborate our problem statement.
What is Vertical Order of Binary Tree?
The nodes, which are at same distance from the root nodes, are said to be on same vertical path. Suppose root is at a distance of 0. Now we will calculate the distance wrt. root node. As we go left
What is Vertical Order of Binary Tree?
The nodes, which are at same distance from the root nodes, are said to be on same vertical path. Suppose root is at a distance of 0. Now we will calculate the distance wrt root node. As we go left
What is diameter of binary tree?
The longest distance between two leaf nodes in binary tree provides us the diameter of binary tree. Let us take the couple of examples.
Given the binary tree, we need to find number of nodes in the given binary tree. To count the number of nodes in binary tree, we need to visit all the nodes at least once. We have counted the number of nodes without recursion using level order traversal in this post.
We are given the Binary Tree, we need to find the minimum and maximum element in the Binary Tree. We will recursively scan the complete binary tree and find out the minimum and maximum element in the binary tree.
Height of binary tree is number of edges from root to the deepest leaf node. We have already discussed the height of binary without recursion using level order traversal.
We are given two binary tree, we need to find out whether one binary tree is mirror of other binary tree. We have discussed about the various examples of mirror binary tree. Let us take a look into two binary trees in below figure.
Binary Tree
Mirror Binary Tree
Breadth First Traversal or Level Order Traversal: As name suggests, in tree traversal, where in we are traversing the breadth of tree. In this traversal, we traverse all nodes across the breadth of binary tree. In level order traversal we perform following procedure:
Traverse the binary tree level by level
At each level we go left to right
Given binary tree in java, print binary tree in reverse order using level order traversal or breadth first search (BFS) non recursive algorithm (example).
We are given the binary tree. We have to print all the ancestors particular node of binary tree. Let us take an example to understand the problem statement.
We have to print all the paths from root to leaf node. Let us take quick example to elaborate the problem statement. Suppose we are given the following binary tree.
