1 files changed, 131 insertions, 0 deletions
diff --git a/37/CH5/EX5.2/s2.sci b/37/CH5/EX5.2/s2.sci
new file mode 100755
index 000000000..07bbfc9f9
--- /dev/null
+++ b/37/CH5/EX5.2/s2.sci
@@ -0,0 +1,131 @@
+funcprot(0);
+function[tree]=maketree(x)
+  tree=zeros(30,1);
+  for i=1:30
+    tree(i)=-1;
+  end
+  tree(1)=x;
+  tree(2)=-2;
+endfunction
+function[tree1]=setleft(tree,tre,x)
+  tree1=[];
+  i=1;
+  while(tree(i)~=-2)
+    if(tree(i)==tre)
+      j=i;
+    end
+    i=i+1;
+  end
+  if(i>2*j)
+    tree(2*j)=x;
+  else
+    tree(2*j)=x;
+    tree(2*j+1)=-2;
+    for l=i:2*j-1
+      tree(i)=-1;
+    end
+  end
+  tree1=tree;
+endfunction
+function[tree1]=setright(tree,tre,x)
+  tree1=[];
+  i=1;
+  while(tree(i)~=-2)
+    if(tree(i)==tre)
+      j=i;
+    end
+    i=i+1;
+  end
+  if(i>2*j+1)
+    tree(2*j+1)=x;
+  else
+    tree(2*j+1)=x;
+    tree(2*j+2)=-2;
+    for l=i:2*j
+      tree(i)=-1;
+    end
+  end
+  tree1=tree;
+endfunction
+function[x]=isleft(tree,tre)
+  i=1;
+  x=0;
+  while(tree(i)~=-2)
+    if(tree(i)==tre)
+      j=i;
+    end
+    i=i+1;
+  end
+  if(i>=2*j)
+    if((tree(2*j)~=-1)|(tree(2*j)~=-2))
+      x=1;
+      return 1;
+    else
+      return 0;
+    end
+  else
+    x=0;
+    return x;
+  end
+endfunction
+function[x]=isright(tree,tre)
+  i=1;
+  x=0;
+  while(tree(i)~=-2)
+    if(tree(i)==tre)
+      j=i;
+    end
+    i=i+1;
+  end
+  if(i>=2*j+1)
+    if((tree(2*j+1)~=-1)|(tree(2*j+1)~=-2))
+      x=1;
+      return 1;
+    else
+      return 0;
+    end
+  else
+    x=0;
+    return x;
+  end
+endfunction
+funcprot(0);
+function[]=inorder(tree,p)
+  if(tree(p)==-1|tree(p)==-2)
+    return;
+  else
+    inorder(tree,2*p);
+    printf("%d\t",tree(p));
+    inorder(tree,2*p+1);
+  end
+endfunction
+function[]=preorder(tree,p)
+  if(tree(p)==-1|tree(p)==-2)
+    return;
+  else
+    printf("%d\t",tree(p));
+    preorder(tree,2*p);
+    preorder(tree,2*p+1);
+  end
+endfunction
+function[]=postorder(tree,p)
+  if(tree(p)==-1|tree(p)==-2)
+    return;
+  else
+    postorder(tree,2*p);
+    postorder(tree,2*p+1);
+    printf("%d\t",tree(p));
+  end
+endfunction
+//Calling Routine:
+tree=maketree(3);
+tree=setleft(tree,3,1);
+tree=setright(tree,3,2);
+tree=setleft(tree,2,4);
+tree=setright(tree,2,5);
+disp("Inorder traversal");
+inorder(tree,1);
+disp("Preorder traversal");
+preorder(tree,1);
+disp("Postorder traversal");
+postorder(tree,1);
+\ No newline at end of file