Adobe Interview Report
- 0of 0 votes
AnswersDelete a given node of a linked list, when you do not have info about the head or any other node.
- nihaldps February 21, 2012 in India
The prototype of the function is -
void delete (Struct node* x)
where x is any arbit node of a linked list.| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Linked Lists - 0of 0 votes
AnswersGiven a graph (consider it to be a mxn grid). The nodes are node of a binary tree with left and right pointers. The start point (A) is at the left upper corner and the end point (B) is at right bottom corner. Each node points to its adjacent nodes in the grid (the right pointer points to the node on the right and the left points to the node just below it). The nodes at the lower and right edges will have child as null (right null for the right side edge and left null for the bottom edge). The end node at B is having both as null.
- nihaldps February 21, 2012 in India
How many paths are possible which can lead you to B, if you start from A?| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Trees and Graphs - 0of 0 votes
AnswersReverse a stack without using extra stack (i.e. doing in place reversal). (hinted about using double recursion).
- nihaldps February 21, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Stacks - 0of 0 votes
AnswersDo a merge of two binary trees and tell what the complexity of the merging is. The trees consist of m and n nodes respect.
- nihaldps February 21, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Trees and Graphs