笔者写的 JavaScript 数据结构与算法之美 系列用的语言是 JavaScript ，旨在入门数据结构与算法和方便以后复习。

十多年来，NAS中已经存在的目录和文件达到10亿之多，在设计和开发备份系统的过程中碰到了很多挑战，本文将分享大量文件名记录的树形结构存储实践。

前端中设计数据结构的方面不多，最常用的就是对树结构的一些操作。从某种意义上来说，前端工作本身就是和树结构打交道的一个工作方向。毕竟，DOM就是天然的树结构。所以如何能够良好地对树结构进行操作，是前端工…

You need to find the largest value in each row of a binary tree.

Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.

Given an n-ary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).

Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might need to change the root of the tree, so the…

Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only 1 right child.

Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.