Sum of smaller elements of nodes in a linked list
Given a linked list, every node of which consists of a pair of integer variables first and second to hold the data, and a pointer… Read More »
Tag Archives: Traversal
Sum of all distinct nodes in a linked list
Given a linked list and it may consist of duplicate nodes. The task is to find the sum of non-duplicate nodes. Examples: Input: 1 ->… Read More »
Check whether the sum of element of a node is equal to the given key value
Given an integer k and a linked list, every node of which consists of a pair of integer variable first and second to hold the… Read More »
Sum of nodes in a linked list which are greater than next node
Given a linked list, the task is to find the sum of all the nodes which are greater than the node next to them. Note… Read More »
Element in a matrix starting from which anti-clockwise traversal ends at the last element
Given a mat[][] of size n X n, the task is to find an element X such that if the anti-clockwise traversal is begun from… Read More »
Find sum of even and odd nodes in a linked list
Given a linked list, the task is to find the sum of even and odd nodes in it separately. Examples: Input: 1 -> 2 ->… Read More »
Print Binary Tree levels in sorted order | Set 3 (Tree given as array)
Given a Complete Binary Tree as an array, the task is to print all of its levels in sorted order. Examples: Input: arr[] = {7,… Read More »
Reverse zigzag Traversal of a Binary Tree
Given a Binary Tree, the task is to print the Reverse zigzag Order of the tree. Examples: Input: 1 / \ 2 3 / \… Read More »
Update adjacent nodes if the current node is zero in a Singly Linked List
Given a linked list. The task is to change the value of the previous and next node of a node to 0 if the current… Read More »
Coefficient of Range in a Binary Tree
Given a Binary Tree, the task is to find the Coefficient of Range in it. Range is defined as the difference between the maximum and… Read More »
Level Order Successor of a node in Binary Tree
Given a binary tree and a node in the binary tree, find Levelorder successor of the given node. That is, the node that appears after… Read More »
Level Order Predecessor of a node in Binary Tree
Given a binary tree and a node in the binary tree, find Levelorder Predecessor of the given node. That is, the node that appears before… Read More »
Print all the levels with odd and even number of nodes in it | Set-2
Given an N-ary tree, print all the levels with odd and even number of nodes in it. Examples: For example consider the following tree 1… Read More »
Print sum of matrix and its mirror image
You are given a matrix of order N*N. The task is to find the resultant matrix by adding the mirror image of given matrix with… Read More »
Search a node in Binary Tree
Given a Binary Node and a node. The task is to search and check if the given node exits in the binary tree or not.… Read More »
