Posting few questions which Playdom asked a friend of mine in telephonic interviews. He had to write code in all cases.
1. Print m*n matrix in spiral form. Modify to make it iterative. 2. Print level order traversal or tree along with level information. Tree need not be complete a 1 b c 2 d e f g 3 3. Write a function which returns inorder successor of a node. Take care of corner cases. Return null if no inorder successor. -- Regards, Navneet -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.