Generate Postorder traversal of Tree from Inorder and Preorder traversal of tree without generating Tree.
Input:
In-order traversal in[] = {4, 2, 5, 1, 3, 6}
Pre-order traversal pre[] = {1, 2, 4, 5, 3, problem
Given a float number convert it into the string WITHOUT using any inbuilt Function
Convert a floating point number to string
Given a float number convert it into the string WITHOUT using any inbuilt Function
Method 1:
class Float2String
{
public static void main(String[] args)
{
float f=7.64f;
String Get K Max and Delete K Max in stream of incoming integers
Get K Max and Delete K Max in stream of Incoming Integers
Solution 1 : Using Min Heap
Algorithm :
1) Keep a Min & Max Heap of K size 2) Store first K elements
building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building
Given n stairs, how many number of ways can you climb if u use either 1, 2 or 3 at a time?
When you find any difficult problem first step is to reduce it to
write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x
Given an array A[] and a number x, check for pair in A[] with sum as x
Write a C program that, given an array A[] of n numbers and another number x, determines whether
… Read More strtok()
Function Strtok
char * strtok ( char * str, const char * delimiters );
What it does : Split string into tokens
A sequence of calls to this function split str into tokens,
which are
Implement a generic binary search algorithm for Integer Double String etc
A Simple Binary Search for Integers
BinarySearch(A[0..N-1], value)
{
low = 0
high = N - 1
while (low <= high) {
mid = low + ((high - low) / 2)
if (A[mid] > value)
Linked List V/S Binary Search Tree
Linked List :
Node(1) -> Node(2) -> Node(3) -> Node(4) -> Node(5) -> Node(6) -> Node(7)
- In linked list, the items are linked together through a single next pointer.
- Next Node’s Key Can be larger
Binary Tree in Java
Implementation of Binary Tree in Java Language.
import java.io.*;
import java.util.*;
class Node
{
public int iData; // data item (key)
public double dData; // data item
public Node leftChild; // this node's left child
Spanning Tree
In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree that includes all of the vertices and some or all of the edges of G.