# find the largest bst(binary search tree) in a binary tree

Given a binary tree find the largest binary search tree.

what is endianess? write a pgm to detremine endianess

 http://betterexplained.com/articles/understanding-big-and-little-endian-byte-order/

# Given a number, find the next number which is a palindrome.

# Given the number 'x' and an array print the pairs in the array where the sum is equal to the given number 'x'

# Find the maximum sum sub array
io [1,2,3]  op [1,2,3] sum = 6
io[-3,-4,-5,-89,-7,4]  op [4] sum = 4
io[45,-2,4,-10,-34] op[45,-2,4]

#Find the maximum product sub array

# mirror effect of the tree.
Given the tree(as array or as reference) return the mirroring of the tree

# Common nearest Ancestor of two nodes in a tree

# Print all the common ancestors of two nodes