## c program to find maximum path sum in binary tree

Write a c program to find maximum path sum in binary tree. The path may starts at any node and end at any other node in the given binary...

## C program to find maximum sum from root to leaf in a binary tree

Given a binary tree write a c program to find maximum sum from root to leaf in a binary tree. For example if given binary tree is as below...

## how to find nth permutation of a string in c

how to find nth permutation of a string in c.write a c program to find nth permutation of a string. For example if given string is “1256” then all...

## what is advantage of pointers over references in c++

Explain in details what is advantage of pointers over references in c++? Pointers can be reassigned while references cannot. Let us see below code pointer.cpp ( below code )...

## what is power set explain with example

what is power set explain it with example? Let me ask one question. What is set? Answer is “a set is collection of distinct objects”. Now let us define...

## Tail Call Optimization and Tail Recursion tutorial

What is Tail Call Optimization and Tail Recursion? what is difference between normal recursion and tail recursion? Tail recursion is a recursion where the recursive call is the very...

## How to implement “Press Any Key To Exit” in c/c++ program

Simulating “Press Any Key To Exit” is easy in windows platform. We can use getch() function to simulate it. see below example for Window machine. How to implement Press...

## what is difference between zombie process and orphan process

what is difference between zombie process and orphan process? explain each with examples in details. orphan process A process is know as orphan process when its parent process do...

## c program to print all possible combinations of given characters

write a c program to print all possible combinations of given characters. For example if given characters are then ,its all possible combinations are as...

## find longest increasing subsequence using recursion

write a recursive function to find longest increasing subsequence using recursion. For example if we have sequence of { 6, 3, 4, 5, 6, 9, 8 }. The longest...