二叉搜索树

本项目是一个包含红黑树和B树以及基于二叉搜索树的汉英词典的实现，共包含三个分支，(project1,bonus,dictionary)。

代码介绍

Requirement.pdf是项目的要求，Report.pdf是项目的实验报告。
具体代码详见三个分支，运行可参考其README.md。

Binary-Search-Tree

This project is an implementation of a Chinese-English dictionary including red-black tree, B-tree and binary search tree, with a total of three branches, (project1, bonus, dictionary).

Code

Requirement.pdf is the requirement of the project, and Report.pdf is the experimental report of the project.
For the specific code, please refer to the README.md of the three branches.