## Find the node with minimum value in a Binary Search Tree using recursion

Given a Binary Search Tree, the task is to find the node with minimum value. Examples: Input: Output: 4 Recommended: Please try your approach on… Read More »

- Reverse zigzag Traversal of a Binary Tree
- Print Binary Tree levels in sorted order | Set 3 (Tree given as array)
- Create new linked list from two given linked list with greater element at each node
- Find sum of even and odd nodes in a linked list
- Element in a matrix starting from which anti-clockwise traversal ends at the last element
- Sum of nodes in a linked list which are greater than next node
- Sum of smaller elements of nodes in a linked list
- Sum of all distinct nodes in a linked list
- Check whether the sum of element of a node is equal to the given key value
- Count duplicates in a given linked list
- Create a linked list from two linked lists by choosing max element at each position
- Print all the sub diagonal elements of the given square matrix
- Print all the super diagonal elements of the given square matrix
- Compare sum of first N-1 elements to Nth element of an array
- Find the node with minimum value in a Binary Search Tree using recursion
- Find the balanced node in a Linked List

Given a Binary Search Tree, the task is to find the node with minimum value. Examples: Input: Output: 4 Recommended: Please try your approach on… Read More »

Given a linked list, the task is to find the balanced node in a linked list. A balanced node is a node where the sum… Read More »

Given a square matrix mat[][] of size n * n. The task is to print all the elements which lie on the super-diagonal of the… Read More »

Given a square matrix mat[][] of size n * n. The task is to print all the elements which lie on the sub-diagonal of the… Read More »

Given a linked list. The task is to count the number of duplicate nodes in the linked list. Examples: Input: 5 -> 7 -> 5… Read More »

Given two linked list of the same size, the task is to create a new linked list using those linked lists. The condition is that… Read More »

Given two linked list of equal sizes, the task is to create new linked list using those linked lists where at every step, the maximum… Read More »

Given an array arr[] of size N, the task is to check whether the sum of first N – 1 element of the array is… Read More »

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 »

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 »

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 »

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 »

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 »

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 »

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 »