Given the sorted linked list, we need to insert the element or node in the linked list such that linked list remains sorted. Suppose the sorted linked list as shown in Fig 1, We need to find the proper place before we need to insert the new element in the linked list, so that sorted order remains intact.
Given the two sorted linked lists, we need to merge these linked lists into single linked list. The resultant linked list should also in sorted one. Let us take a look into the examples to clear our problem statement.
Given a single linked list, we will delete all nodes of single linked list i.e. We want to delete the
Given a single linked list, count number of times given element exist in a single linked list. e.g. if we want
Given the linked list, we need to reverse a linked list in pairs. We need to reverse the nodes in pair. We need to swap the references of alternate nodes, as a result we will get reversed linked list in pairs.
Given the linked list, we need to find out whether the loop exist in the linked list. We need to find if there is any cycle in the linked list. Let us take an example to elaborate the problem statement. We have shown the linked list in Fig 1.
Given the two linked list, they are intersected at some node. We need to find out the intersection point of these two linked list. We have shown two linked list Linked list 1 and linked list 2, both linked lists are intersected at node 50. We need to find out the node 50 as per our problem statement.
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.
We are given two binary tree, we need to find out whether one binary tree is Isomorphic of other binary tree. What is Isomorphic meaning? As per English dictionary meaning is “being of identical or similar form, shape, or structure”. By apply above definition to our problem statement, If given binary have identical or similar form or shape or structure to another binary tree, we can say that trees are isomorphic.
Given the binary tree, we need to print the nodes at a K (Means it can be any number as per the user input like 1 or 2 or 3 or any arbitrary number) distance from Leaf Nodes. Let us elaborate the problem statement by taking example.
Given the binary tree, we need to print the nodes at a K (Means it can be any number as per the user input like 1 or 2 or 3 or any arbitrary number) distance from root.
Given the binary tree, we need to print the number which are in a given range. We will be given the two numbers K1 and K2, we need to print all numbers within the range of K1 and K2 ( number > k1 and number < k2).
Let us understand the problem statement. Given the number , we need to find the node in the binary tree having data equal to given number and we will delete the found node. Suppose we are given the tree as shown in Fig 1, we will analyse BST to delete a node.
Predecessor of any node is the previous node of binary traversal. Let us take an example to understand the inorder predecessor in binary search tree. We have already discussed about the inorder successor. The logical flow of inorder predecessor and inorder successor is same. If we understand any one of them, other can be solved in similar manner.
Successor of node is the next node of binary traversal. Let us take an example to understand the inorder successor in binary search tree. We have discussed about the inorder predecessor. The logical flow of inorder predecessor and inorder successor is same.
To delete binary tree, we have to delete all the nodes in the tree. We have discussed about deleting the node in binary search tree in separate post. Before we discuss about deleting tree, we will start from very small tree, then we will use this foundation to delete the whole tree. Suppose we have tree of 3 nodes
