## Find postorder traversal of BST from preorder traversal

Given an array representing preorder traversal of BST, print its postorder traversal. Examples: Input : 40 30 35 80 100 Output : 35 30 100… Read More »

Given an array representing preorder traversal of BST, print its postorder traversal. Examples: Input : 40 30 35 80 100 Output : 35 30 100… Read More »

Given an array A of N numbers where Ai represent the value of the (i+1)th node. Also given are M pair of edges where u… Read More »

Given a Binary tree and a number N, write a program to find the N-th node in the Postorder traversal of the given Binary tree.… Read More »

Given an array of integers, and a number ‘sum’, print all pairs in the array whose sum is equal to ‘sum’. Examples : Input :… Read More »

Given a binary tree, change the value in each node to sum of all the values in the nodes in the right subtree including its… Read More »

Given a number N which represents the total distance in km to be covered by a car on a single road. There are N petrol… Read More »

The backbone analysis of any network is broadly accomplished by using Graph Theory and its Algorithms. The performance constraints are Reliability, Delay/Throughput and the goal… Read More »

Write a C function that moves first element to end in a given Singly Linked List. For example, if the given Linked List is 1->2->3->4->5,… Read More »

Prerequisite – Hashing Introduction, Hashtable using Singly Linked List & Implementing our Own Hash Table with Separate Chaining in Java Implementing hash table using Chaining… Read More »

Given a grid with different colors in a different cell, each color represented by a different number. The task is to find out the largest… Read More »

Given an array of N positive integers. The task is to find the sum of maximum sum decreasing subsequence(MSDS) of the given array such that… Read More »

Given a Sudoku Board configuration, check whether it is valid or not. Examples: Input: [5 3 – – 7 – – – -] [6 -… Read More »

Given a binary search tree and a target node K. The task is to find the node with the minimum absolute difference with given target… Read More »

Coalesced hashing is a collision avoidance technique when there is a fixed sized data. It is a combination of both Separate chaining and Open addressing.… Read More »

Given a Binary tree and a number N, write a program to find the N-th node in the Preorder traversal of the given Binary tree.… Read More »