10 2016 档案

二叉排序树BST+求树深度算法
摘要：#include "stdio.h"#include "malloc.h"typedef struct node { int key; struct node *lchild, *rchild; }BSTNode, *BSTree;void InsertBST(BSTree *bst, int ... 阅读全文
posted @ 2016-10-31 20:35 Tovi 阅读(349) 评论(0) 推荐(0)