huchangchun的专栏

This document explains how pointers and memory work and how to use them—from the basic concepts through all the major programming techniques. For each topic there is a combination of discussion, sample C code, and drawings.

二叉查找树的实现。包括树的平衡以及树节点的删除。以及树的广度优先遍历，深度优先遍历。

AB序列，是一道经典的算法题。可以google搜索“AB”序列。 这儿是Java实现代码