Building binary tree from preorder bitstring?

It's not in an infinite loop. Its just waiting for input from System.in.

(char) 0 is the character which is represented by Unicode U+0000 (NUL). You want to use '0' (U+0030) in your test. As an aside, the problem setter has not stated whether the given preorder is depth-first or breadth-first (or something else), so one cannot be certain how to rebuild the tree correctly.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.