思路1 利用栈

并用count记录一行结点的个数

Previous0102_Binary_Tree_Level_Order_TraversalNext0103_Binary_Tree_Zigzag_Level_Order_Traversal

Last updated

Was this helpful?