摘要:
树的遍历: 1,前序遍历 void PreOrderTraversal(BinTree T){ BinTree T_temp = T; stack<TreeNode*> sta; while(T_temp || !sta.empty()){ while(T_temp){ Print_elm(T_te 阅读全文
摘要:
1,顺序查找 #include <bits/stdc++.h> using namespace std; #define MaxSize 100 struct ElementType{ string name; int age; }; typedef struct Node* List; struc 阅读全文