masoom
BAN USER- 0of 0 votes
AnswersYou are given a function getInorderSuccessor which takes a BST (Binary Search Tree) as it's parameter. Every node has an extra pointer "next" , which is intialized to null, fill next with node pointers which represent Inorder Successor.
- masoom in India
In a binary tree, inorder successor of a node is the next node in inorder traversal of the binary tree. Inorder successor is NULL for the last node in inorder traversal.
In BST, inorder successor of an input node can also be defined as the node with the smallest key greater than the key of input node. So, it is sometimes important to find next node in sorted order.
Sample Input :
Sample output.
The value of the node pointed by the next pointer is marked in { }
NOTE: The preorder of the tree you return would be printed to help you in debugging| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
AnswersYou are given a function printKDistanceNodes which takes in a root node of a binary tree, a start node and an integer K. Complete the function to print the value of all the nodes (one-per-line) which are a K distance from the given start node in sorted order. Distance can be upwards or downwards.
- masoom in India
Example:
Sample Input:
Root node: 5
Given start node: 8
Distance (K): 1
Sample Output:
5
6
9| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
AnswersIn given array of elements like [a1,a2,a3,..an,b1,b2,b3,..bn,c1,c2,c3,...cn] Write a program to merge them like [a1,b1,c1,a2,b2,c2,...an,bn,cn].
- masoom in India
PS: Do it without using extra memory
Sample Testcases:
Input #00:
{1,2,3,4,5,6,7,8,9,10,11,12}
Output #00:
{1,5,9,2,6,10,3,7,11,4,8,12}
Explanation:
Here as you can notice, the array is of the form
{a1,a2,a3,a4,b1,b2,b3,b4,c1,c2,c3,c4}| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Data Structures - 0of 0 votes
Answersfind the length of string without using inbuilt methods in java
- masoom in India| Report Duplicate | Flag | PURGE
Samsung Java Developer Java - 0of 0 votes
Answersprint a tree with label wise in given that scenario
- masoom in India
15
12 23
9 16 17 35| Report Duplicate | Flag | PURGE
Developer Program Engineer Java
finally block are executed irrespective of whether there are an exception or not.this ensures that all the opened files are properly closed and all the running threads are properly terminated.so the data in the files will not be corrupted and the user is at the safe side.
- masoom April 12, 2012