## Find Merge Point of Two Linked Lists

Write a c program to find merge point of two linked lists. You’re given the pointer to the head nodes of two linked lists that merge together at some...

## Top 35 linked list interview questions

Linked list is favorite interview question. Here are top 35 linked list interview questions. practice all these questions for your software job interview. Kindly search these questions on stackoverflow.com...

## Top 20 interview questions on binary trees

Binary tree is very basic data structure in software program. below is top 20 interview questions on binary trees that are commonly asked during software job’s interview. construct binary...

## c program for min heap

Write a c program for min heap. For example you are given a list of numbers 9 8 -6 3 1 -5 then write c program to make min...

## max heap and min heap c program

Max heap and min heap is a complete binary tree with special property. Max Heap, A complete binary tree where each node value is less than or equal to...

## how to print all paths in a directed graph

“how to print all paths in a directed graph” is famous question asked in programming interview. Given a directed graph write a c program to find all paths between...

## Second best minimum spanning tree

Given an input graph find the second best minimum spanning tree. A second best minimum spanning tree is a tree whose total weight of the edges is greater than...

## How to check whether a Binary tree is subtree of another binary tree

Write a C/C++ program to check whether a binary tree is subtree of another binary tree. For example in given below example tree T and another tree P, the...

## Print all path of binary tree ,Path from root to leaf node

Given a binary tree , write a c program to print all path of binary tree, Path from root to leaf node. For example below binary tree , the...

## C program to calculate maximum depth or height of a binary tree

The maximum depth or height of a binary is the number of nodes from root node to its farthest or deepest leaf node. For example the below binary tree...