【强化练习】运用层序遍历解题 II

431. 将 N 叉树编码为二叉树 https://leetcode.cn/problems/encode-n-ary-tree-to-binary-tree

431. Encode N-ary Tree to Binary Tree https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree

919. 完全二叉树插入器 https://leetcode.cn/problems/complete-binary-tree-inserter

919. Complete Binary Tree Inserter https://leetcode.com/problems/complete-binary-tree-inserter

872. 叶子相似的树 https://leetcode.cn/problems/leaf-similar-trees

872. Leaf-Similar Trees https://leetcode.com/problems/leaf-similar-trees

863. 二叉树中所有距离为 K 的结点 https://leetcode.cn/problems/all-nodes-distance-k-in-binary-tree

863. All Nodes Distance K in Binary Tree https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree

742. 二叉树最近的叶节点 https://leetcode.cn/problems/closest-leaf-in-a-binary-tree

742. Closest Leaf in a Binary Tree https://leetcode.com/problems/closest-leaf-in-a-binary-tree

582. 杀掉进程 https://leetcode.cn/problems/kill-process

582. Kill Process https://leetcode.com/problems/kill-process

536. 从字符串生成二叉树 https://leetcode.cn/problems/construct-binary-tree-from-string

536. Construct Binary Tree from String https://leetcode.com/problems/construct-binary-tree-from-string