Create Populating_Next_Right_Pointers_in_Each_Node_II.java

"Follow up for problem "Populating Next Right Pointers in Each Node".

What if the given tree could be any binary tree? Would your previous solution still work?

Note:

You may only use constant extra space."