二叉樹的每一層橫向節點用next鏈接（進階版）

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

>>阅读原文<<