Q: Given two BST's A, B, Find All elements of A which are present in B
OR
You are given the root nodes of two BST and you have to print the common elements in them.
Subscribe to:
Post Comments (Atom)
Recent comments
Popular Posts
-
How to remove extra bracket from expressions like ((((A+B)) C)) to give (A+B) C in the most optimized way? Remember the input expression w...
-
Web crawler is a program that traverses the hyperlinks structure of web pages. We crawler visits each web page by following the hyperlinks o...
-
A sample application to demonstrate the session id using flex and PHP Whenever you press the hts.send button in the upper left corner...... -
The ternary search tree contains three types of links. First, there are pointers that correspond to links in the corresponding trie, shown a...
-
A long array A[] is given to you. There is a sliding window of size w which is moving from the very left of the array to the very right. You...
-
Tried out this sample application withe Flex and adobe AIR integrated SQLite. It has the Insert and Delete functionality. Will post the upda... -
Q: Given an integer x and an unsorted array of integers, describe an algorithm to determine whether two of the numbers add up to x. If we ...
-
Q: An array contain positive and negative elements, find maximum subarray whose sum is equal to zero. Algorithm: Lets take input array a...
-
A simple application demonstrating the free mouse drawing in flex.... View the application.... Source Code: <?xml version=... -
In the last post we have seen dynamic programming approach which takes O(n^2) time. We can improve the algorithm to take O(N log N) time.The...
Subscribe To
Posts
Comments
No comments:
Post a Comment