I mean for dfs u would make use of a for or while loop, the question says that we shouldn't use loops..
Regarding the first question, I think it should be done using HashMap with ticketNo being the key and personName being the value, but I am not sure on how to do it.
ElkeRoll, Animator at A9
I am Elke from the USA. I am working as a technologist in Hill-Behan company. I perform and analyze the ...
genoimthomas666, Android test engineer at 8x8
Hey, I'm a Training and Development Manager. And I love my work. Apart from this, I am doing some ...
AlvaPolly, Animator at ADP
I am Alva , working as a Brand Specialist with two years experience in Keeney's. I’ve excellent communication and ...
Find the position of both nodes A and B, if A < B then divide B by 2 till its value is less A, then continue the same with A and repeat it again till A = B.- krithick.krishnagiri April 19, 2011