end Lesson 1

bjeanlou
1 parent 500d264d
Showing 4 changed files with 73 additions and 9 deletions Show diff stats
Slist.c
Slist.h
tree.c
tree.h
 #include "Slist.h"
+
+List make_empty_list(){
+  return NULL;
+}
+
+int is_empty(List l){
+  return l==NULL;
+}
+int isIn_List(List l, char e){
+  return !is_empty(l) &&
+    (isIn_tree(l.letter,e) ||
+     isIn_list(l.next,e));
+}
+
+
+//add
+void addHead(List*l,char e){
+  cell* tmp=malloc(sizeof(cell));
+  tmp->letter=make_tree(e);
+  tmp->next=*l;
+  *l=tmp;
+}
+void addNext(List*l,char e){
+  if(is_empty(*l))
+    addHead(l,e);
+  else{
+    cell* tmp=malloc(sizeof(cell));
+    tmp->letter=make_tree(e);
+    tmp->next=*l->next;
+    *l=tmp;
+}
+void addAlpha(List*l,char e){
+  if(is_empty(*l) || e<(l->letter->val)){
+    addHead(l,e);
+    return;
+  }
+  cell* crt=*l;
+  while(!is_empty(crt->next) && e < crt->next->letter->val)
+    crt=crt->next;
+  if(is_empty(crt->next))
+    addHead(&crt->next,e);
+
+  if(e> crt->next-letter->val){
+    
+}
@@ -14,9 +14,10 @@ typedef
 //function
 List* make_empty_List();
 int is_empty(List);
-tree* head(List);
-List* Queue(List);
-
+int isIn_list(List,char);
+void addAlpha(List*,char);
+void addHead(List*,char);
+void addNext(List*,char);
  
  
  
 #include "tree.h"
+
+tree make_empty_tree(){
+  return NULL;
+}
+int is_empty(tree t){
+  return t==NULL;
+}
+int is_leaf(tree t){
+  return is_empty(t.next);//<=>t.val=='\0'
+}
+int is_end(tree t){
+  return isIn_list(t.next,'\0');
+}
+
@@ -15,17 +15,21 @@ typedef
  
  
 //functions
-tree* make_empty_tree();
+tree make_empty_tree();
+tree make_tree(char);
+int is_empty(tree);
+int is_leaf(tree);
+int is_end(tree);
 tree* cons_tree();
 tree* load_tree(FILE*,tree*);
-int is_empty(tree);
-char value(tree);
 //char*? values(tree);
 void print_all(tree);
-int isIn(tree,string);
-
-
+int isIn_tree(tree,char);
+int strIsIn_tree(tree,string);
  
  
+/*
+words end with '\0' and 
+*/
  
 #endif //TREE_H