二叉树的每一层横向节点用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

>>阅读原文<<