在Java语言中实现动态数据结构

就如何在摒弃了指针的 Ｊａｖａ语言中实现动态数据结构提出了两种解决方案：用 ｖｅｃｔｏｒ类和用数组实现之。以二叉树为例分别给出了两种方法的实现算法，讨论了它们各自的优缺点。

Implementation of dynamic data structure in Java

Dynamic data structure is the most important data type in Pascal, C, C in which dynamic data structure is implemented with pointer; How to implement dynamic data structure in Java is discussed,which does not have pointer, is discussed. Two techniques are proposed to implement with vector class and array. An example of binary tree implemented using the above two methods is given with the comparing of the methods.