这是悦乐书的第 225 次更新，第 238 篇原创 01 看题和准备 今天介绍的是LeetCode算法题中Easy级别的第92题（顺位题号是429）。给定n ary树，返回其节点值的级别顺序遍历。（即，从左到右，逐级）。例如，给定一个3 ary树： 我们应该返回它的级别顺序遍历： [[1]，[3,2 ...
分类：
编程语言 时间：
2019-01-09 11:26:19
阅读次数：
147
You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way. The null node needs to be rep ...
分类：
其他好文 时间：
2019-01-07 17:51:47
阅读次数：
152
Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to ou ...
分类：
其他好文 时间：
2019-01-06 14:22:02
阅读次数：
165
Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For example, ...
分类：
其他好文 时间：
2019-01-01 11:14:07
阅读次数：
143
Return any binary tree that matches the given preorder and postorder traversals. Values in the traversals pre and post are distinct positive integers. ...
分类：
其他好文 时间：
2019-01-01 11:04:36
阅读次数：
136
Given a binary tree, return the inorder traversal of its nodes' values. Example: Input: [1,null,2,3] 1 \ 2 / 3 Output: [1,3,2] Follow up: Recursive so ...
分类：
其他好文 时间：
2019-01-01 11:02:35
阅读次数：
183
https://pintia.cn/problem-sets/994805342720868352/problems/994805485033603072 Suppose that all the keys in a binary tree are distinct positive integer ...
分类：
其他好文 时间：
2018-12-29 11:57:06
阅读次数：
175
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For ...
分类：
其他好文 时间：
2018-12-29 11:21:15
阅读次数：
115
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree [3 ...
分类：
其他好文 时间：
2018-12-29 11:14:53
阅读次数：
182
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and ...
分类：
其他好文 时间：
2018-12-29 11:09:36
阅读次数：
121
