摘要
二叉树是一种重要的数据结构,而有序二叉树是一种重要的二叉树。本文讨论了在 PDC-PROLOG 中,用递归技术对有序二叉树进行插入与删除结点。
Binary tree is an important data structures,but ordered binary tree is an important binary tree.This paper discusses to insert and delete nodes of the ordered binary tree with recursive tech- nique in the PDC-PROLOG.
出处
《哈尔滨师范大学自然科学学报》
CAS
1997年第2期56-59,共4页
Natural Science Journal of Harbin Normal University
