二叉树数据结构在植物检索中的应用

Application of the Binary Tree Data Structure in Plant Retrieval

通过对植物检索表的编制和使用方法分析,并对其中异常结点进行深入研究,解决了因多父结点的存在致使二叉树查询不便的问题,在此基础上用计算机实现了植物检索,使"植物信息管理系统"的功能得到进一步完善。

The problem of inconvenient inquiring in binary because of the existence of more than one father nodes was solved through making, using plant retrieval and studying further about abnormal nodes. Based on this, the plant retrieval in computer was realized and the plant information management system was improved.