Question

Binary search tree using Pascal

Asked by: cipher007

Could anybody change the following BST code so that the input could be read from a text file and the searched data could be output to the screen.
===================================================================================
Program Bsearch(input,output);
Uses wincrt;
Const exitpro = -1;
Type
    Element = Word;


    Ptr = ^Nodetype;


    Nodetype = Record
               Key:Element;
               Left,Right:Ptr;
               End;


    Treeptrtype = Ptr;


Var Select:Integer;
    Rootptr:Treeptrtype;
    Targettype:Element;
    Positionptr:Ptr;
    Depthtype:Word;
    Newnodeptr:Treeptrtype;
    Nextnode:Element;


Procedure InitTree(Var Root:TreePtrType);
Begin
     Root := nil;
     Writeln('The tree has been initialised.');
     Delay(1000);
End;


Function TreeEmpty(Root:TreePtrType):boolean;
Begin
     TreeEmpty := (root = nil)
End;


Procedure SearchTree(Root:TreePtrType; Target:word;
                   Var Position:Ptr; Var Depth:word);
Begin
     If root = nil then
        Position := nil
     Else
     Begin
          If root^.key = target then
             Begin
                  Position := root;
                  Depth := 1;
             End
          Else if target < root^.key then
               Begin
                    Depth := depth+1;
                    SearchTree(root^.left,target,position,depth);
               End
               Else Begin
                    Depth := depth+1;
                    SearchTree(root^.right,target,position,depth);
                    End;
     End;
End;


Procedure AddToTree(Var Root:TreePtrType; NewNode:TreePtrType);
Begin
     If root = nil then
     Begin
          Root := newnode;
          Root^.left := nil;
          Root^.right := nil;
     End
     Else if newnode^.key < root^.key then
             AddToTree(root^.left,newnode)
          Else
              AddToTree(root^.right,newnode);
End;


Procedure PreOrder(Root:TreePtrType);
Begin
     If root <> nil then
     Begin
          Writeln(Root^.key);
          PreOrder(Root^.left);
          PreOrder(Root^.right);
     End;
End;


Procedure PostOrder(Root:TreePtrType);
Begin
     If root <> nil then
     Begin
          PostOrder(Root^.left);
          PostOrder(Root^.right);
          Writeln(Root^.key);
     End;
End;


Procedure InOrder(Root:TreePtrType);
Begin
     If root <> nil then
     Begin
          InOrder(Root^.left);
          Writeln(Root^.key);
          InOrder(Root^.right);
     End;
End;


Procedure Screen(Var Choice:integer);
Begin
     Clrscr;
     Writeln;
     Writeln('1.     Initialise a tree');
     Writeln('2.     Add an item to a tree <a positive integer>');
     Writeln('3.     Search for an item in the tree');
     Writeln('4.     Preorder printout of tree');
     Writeln('5.     Postorder printout of tree');
     Writeln('6.     Inorder printout of tree');
     Writeln('7.     Quit');
     Writeln;
     Write('Please enter your choice: ');
     Readln(choice);
     Writeln;
     If (Choice < 1) or (Choice > 7) then
     Begin
        Writeln('Only options 1 to 7 are available.');
        Delay(1000);
     End;
End;


Begin {Main}
     Repeat
           Screen(select);
           Case select of
                1 : InitTree(rootptr);
                2 : Begin
                    Writeln('Enter ',exitpro:1,' to stop.');
                    Write('Enter next data value or ',exitpro:1,' to stop.');
                    Readln(newnodeptr.key);
                    While nextnode <> exitpro do
                    AddToTree(rootptr,nextnode);


                    End;
                3 : SearchTree(rootptr,targettype,positionptr,depthtype);
                4 : Preorder(rootptr);
                5 : Postorder(rootptr);
                6 : Inorder(rootptr);
           End;
     Until select = 7;
End.
==================================================================================
thanks

This Question has been solved and asker verified All Experts Exchange premium technology solutions are available to subscription members.

Subscribe now for full access to Experts Exchange and get

Instant Access to this Solution

  • Plus...
  • 30 Day FREE access, no risk, no obligation
  • Collaborate with the world's top tech experts
  • Unlimited access to our exclusive solution database
  • Never be left without tech help again

Subscribe Now

Asked On
2007-07-25 at 02:59:09ID22719341
Tags

pascal

,

binary

,

tree

,

search

Topic

Pascal Programming Language

Participating Experts
3
Points
500
Comments
13

Trusted by hundreds of thousands everyday for fast, accurate and reliable tech support.

  • "The time we save is the biggest benefit of Experts Exchange to Warner Bros. What could take multiple guys 2 hours or more each to find is accessed in around 15 minutes on Experts Exchange." Mike Kapnisakis, Warner Bros.
  • "Our team likes having a resource that is more secure than just using Google and most experts using this service really know their stuff. It's nice to look here first versus using Google." Dayna Sellner, Lockheed Martin
  • "Anytime that I've been stumped with a problem, 9 out of 10 times Experts Exchange has either the accepted solution or an open discussion of the potential solution to the problem." Kenny Red, eBay Inc.

See what Experts Exchange can do for you.

Got a question?

We've got the answer.

Experts Exchange has been collecting answers to technology questions since 1996…3 million and counting! If you have a question, chances are we already have your answer.

Screenshot of Experts Exchange Knowledgebase

Need individual assistance?

Our experts are ready to help.

If you can't find the exact answer you're looking for, ask our exclusive community of 50,000 experts. You’ll get a personalized answer from a trusted professional.

Screenshot of Experts Exchange Knowledgebase

Want to learn from the best?

Read articles from industry experts.

Thousands of free tech tips, tricks, how-to’s and tutorials are available in our peer reviewed articles section. See for yourself how smart our experts are, no login required.

Screenshot of an Article

Working on a long term project?

Store your work and research.

Save solutions to your questions, answers you’ve discovered through searching plus helpful articles in your personal knowledgebase for easy future access.

Screenshot of Experts Exchange Knowledgebase

Access the answers to your technology questions today.

Subscribe Now

30-day free trial. Register in 60 seconds.

What Makes Experts Exchange Unique?

Members of the expert community talk about why the experience at Experts Exchange is different than what you will find anywhere else.

Trusted by the world's most respected brands.

image of each brand's logo

Faithfully serving IT professionals since 1996.

Experts Exchange Logo

Try it out and discover for yourself.

Subscribe Now

30-day free trial. Register in 60 seconds.

Related Solutions

  1. ReadLn and WriteLn max character limit
    I am using Delphi 3. Assuming MyText is a long String variable, and assuming I have a text file on my drive called "c:\test.txt" containing a single line of ASCII characters (156 consecutive letters, followed by a #32, followed by 156 more consecutive letters). If...
  2. Heap in pascal
    Hello. I need a simple implementation of a heap data structure in pascal. a node in the heap should contain an integer number. I need it to run some algorithms on it, and I'm not sure I can write it well myself. I need it in plain pascal and not Delphi. A source code pro...
  3. Pascal : multiplying matrices...
    Hi, I'm learning pascal and i dont know how to multiply matrices. My program is below, Could someone please fill in the area where I marked please ? thank you. VAR errorE : BOOLEAN; quitit, opr : CHAR; tempkey, ukey, k, l, i, j, r1, {row size of...
  4. Date declaration in Pascal
    Hi Amit, I wrote a simple pascal program. what i'm trying to do now is to read the system date (DD-MM-YYYY) and writes to the AERERT.dat. how to i go about doing that . could you please help. thanking you in advance. Thank you. program DF_system_interface; ...
  5. Convert Pascal to Java
    can anybody who is expert in Pascal and Java, help me to convert the following Pascal coding to Java coding. the program is about convert infix to postfix using stack. since i have no idea in Pascal, can any body do me a favour? thanks. here is the coding: program infixtop...

Free Tech Articles

  1. WARNING: 5 Reasons why you should NEVER fix a computer for free.
    It is in our nature to love the puzzle. We are obsessed. The lot of us. We love puzzles. We love the challenge. We thrive on finding the answer. We hate disarray. It bothers us deep in our soul. W...
  2. SCCM OSD Basic troubleshooting
    SCCM 2007 OSD is a fantastic way to deploy operating systems, however, like most things SCCM issues can sometimes be difficult to resolve due to the sheer volume of logs to sift through and the dispe...
  3. Migrate Small Business Server 2003 to Exchange 2010 and Windows 2008 R2
    This guide is intended to provide step by step instructions on how to migrate from Small Business Server 2003 to Windows 2008 R2 with Exchange 2010. For this migration to work you will need the fo...
  4. Create a Win7 Gadget
    This article shows you how to create a simple "Gadget" -- a sort of mini-application supported by Windows 7 and Vista. Gadgets can be dropped anywhere on the desktop to provide instant information, ...
  5. Outlook continually prompting for username and password
    There have been a lot of questions recently regarding Outlook prompting for a username and password whilst using Exchange 2007. There are a few reasons why this would happen and I will try to cover t...
  6. Backup Exchange 2010 Information Store using Windows Backup
    There seems to be quite a lot of confusion around the ability to backup Exchange 2010 using the built in Windows Backup feature. This stems from the omission of this feature prior to Exchange 2007 s...

Cloud Class Webinars

  1. Avoiding Bugs in Microsoft Access
    Alison Balter takes and in-depth look at avoiding bugs in Access. In this webinar you will learn about using the immediate window to debug your applications, invoking the debugger, using breakpoints to troubleshoot, stepping through code, setting the next statement to execute, ...
  2. Top 10 Best New Features in Visio 2010
    Scott Helmers gives live demonstrations of the top 10 new features in Visio 2010. This webinar will teach you how to create compelling diagrams by adding shapes to the page with a single click, linking the shapes in a diagram to data in Excel (or SQL Server, or SharePoint), ...
  3. IT Consultant Business Secrets Revealed
    Michael Munger, Experts Exchange tech pro and IT consultant, pulls back the curtain on his very successful businesses and answers question on every IT consultant and business owner should know about. He shares secrets on what he did to solve the 5 most common problems in IT, ...
  4. Disaster Recovery and Business Continuity
    Quest CTO, Mike Billon, gives an overview of the steps involved in building a dunamic disaster recovery plan. Through case studies and an examination of software/hardware tooles for monitoring and testing, you'll gain a better understandin of where you are, where you want ...
  5. Organize Your Visio Diagrams with Containers and Lists
    Scott Helmers uses cross functional flowcharts, wireframe diagrams, data graphic legends and seating charts to teach you: how to ustilize all three new structured diagram components in Visio 2010, the best practices for organizeing shapes in previous version of Visio, how to organize ...
  6. How to Us Objects, Properties, Events and Methods in Microsoft Access
    Alison Dalter gives an in-depbth look at objects, properties, events and methods in Microsoft Access. In this webinar you will learn about using the object browser, referring to objects, working with properties and methods, working with object variables, understanding the ...

Join the Community

Give a Little. Get a Lot.

Join the community of experts here and help other tech pros by answering question in your area of expertise. You can earn FREE access to all Experts Exchange's premium features and resources.

Join the Community

Answers

 

by: diniludPosted on 2007-07-25 at 05:43:10ID: 19564809

is your code is working?

 

by: ozoPosted on 2007-07-25 at 07:33:01ID: 19565695

reset(input,'text.file ');

 

by: whatboyPosted on 2007-07-25 at 08:15:09ID: 19566220

Borland Pascal???

If so, your code would not work like that... you never assign memory to any pointer...

http://www.experts-exchange.com/Programming/Languages/Pascal/Q_20092424.html


the way to ADD items to a link is... This code only add items, it does not sort'em...

Type
  PointerToList = ^List;
  List = Record
    Value: Integer;
    PrevItem: PointerToList;
    NextItem: PointerToList;
  End;

{ Procedure to add items into the list }
Procedure AddItem (Newvalue: Integer);
Begin
  {Check If this is the first time the structure is going to be created}
  If Current = NIL Then
    Begin
      New(Current); {Get memory for the data}
      With Current^ do  {Fill in the data}
        Begin
          Value:=NewValue;
          NextItem:=NIL; {Since there are any more Up this points NIL}
          PrevItem:=NIL  {Since there are any more Down this points NIL}
        End;
      Start:=Current;
      Finish:=Current
    End
  Else  {Now this is not the first time}
    Begin
      New(Finish);
      Finish^.PrevItem:=Current; {Current <- Finish}
      Finish^.NextItem:=NIL;     {Finish -> Nil}
      Current^.NextItem:=Finish; {Current -> Finish}
      Current:=Finish;       {Current:=Finish}
      With Current^ do  {Fill in the data}
        Begin
          Value:=NewValue;
        End
    End
End;


This code sort'em up... using the bubble method, not the binary...

{ Procedure to sort the list using the bubble sort method }
Procedure Sort_List;
Var
  Index1,Index2: Integer;
  MaxNum: Integer;

  Procedure ChangePlaces(Var Prev,Curr: PointerToList);
  Var
    Temp: Integer;
  Begin
    Temp:=Prev^.Value;
    Prev^.Value:=Curr^.Value;
    Curr^.Value:=Temp;
  End;

Begin
  MaxNum:=Count_Items;
  Previous:=Start;
  Current:=Finish;
  For Index1:=1 To MaxNum-1 Do
    Begin
      For Index2:=MaxNum DownTo Index1+1 Do
        Begin
          If Previous^.Value > Current^.Value Then
            ChangePlaces(Previous,Current);
          Current:=Current^.PrevItem;
        End;
      Previous:=Previous^.NextItem;
      Current:=Finish;
    End
End;


The way to read/write from File... is...

http://www.experts-exchange.com/Programming/Languages/Pascal/Q_20465314.html

 

by: cipher007Posted on 2007-07-25 at 14:50:03ID: 19570133

Forget about the code I have posted as it doesn't work, I thought it would give you some idea.

Ok, let me be more specific.
I am using TPW 1.5
Here's what I want the code to do.
The code should use binary search tree data structure
It should read from a text file (eg. the file would contain 1,2,3,4,5,6.... single number on a line would be fine)
The user should be able to add, delete and search numbers from the file.
The file contents should be listed (displayed on screen as a tree format...  e.g like the tree below)

                    4
                /        \
             2             6
          /     \         /     \
       1         3    5       7
So, basically its a binary search tree and the user should be able to add, delete, search and display the contents of the tree.

PS: I would add a bonus of 500 points to for the complete solution.

Thanks

 

by: diniludPosted on 2007-07-25 at 22:42:06ID: 19572105

Shall i try in delphi. i don't know Turbo Pascal

 

by: diniludPosted on 2007-07-26 at 06:05:05ID: 19574016

What is the Text file format?

Each line contain each number?

 

by: cipher007Posted on 2007-07-26 at 18:30:03ID: 19579649

Program should be in pascal, please :-)
Windows text file.
Each line contain each number? yeah that would be fine.

Thanks for trying

 

by: diniludPosted on 2007-07-27 at 01:25:54ID: 19580885

program BSearch;


uses wincrt;

Const exitpro = -1;
Type
    Element = Word;

    Ptr = ^Nodetype;

    Nodetype = Record
               Key:Element;
               Left,Right:Ptr;
               End;

    Treeptrtype = Ptr;




Var Select:Integer;
    Rootptr:Treeptrtype;
    Targettype:Element;
    Positionptr:Ptr;
    Depthtype:Word;
    Newnodeptr:Treeptrtype;
    Nextnode:Treeptrtype;
    NewElement:Integer;
    S:string[11];


procedure DisplayTree(Distance,depth:Byte;Node:Treeptrtype);
var s:string;
begin
  if Node<>nil then
  begin
     str(Node^.key,s);
     gotoxy(Distance,depth);
     writeln(s);
     gotoxy(Distance-2,depth+1);
     if Node^.left<>nil then  writeln('/');
     gotoxy(Distance+2,depth+1);
     if Node^.right<>nil then  writeln('\');
     DisplayTree(Distance-4,depth+2,Node^.left);
     DisplayTree(Distance+4,depth+3,Node^.right);
  end;
end;


procedure FreeTree(var Root:TreePtrType);
begin
  if Root<>nil then
  begin
     FreeTree(Root^.Left);
     FreeTree(Root^.right);
     Dispose(Root);
  end;
end;

Procedure InitTree(Var Root:TreePtrType);
Begin
     FreeTree(Root);
     Root := nil;
     Writeln('The tree has been initialised.');
End;


Function TreeEmpty(Root:TreePtrType):boolean;
Begin
     TreeEmpty := (root = nil)
End;

{Procedure AddToTree(Var Root:TreePtrType; NewNode:TreePtrType);
var BackRoot:TreePtrType;
Begin

     If root = nil then
     Begin        
          Root := newnode;
          Root^.left := nil;
          Root^.right := nil;

     End
     Else if newnode^.key < root^.key then
             AddToTree(root^.left,newnode)
        Else AddToTree(root^.right,newnode);
End;}

Procedure AddToTree(Var Root:TreePtrType; NewNode:TreePtrType);
var BackRoot:TreePtrType;
Begin

     If root = nil then
     Begin
          Root := newnode;
          Root^.left := nil;
          Root^.right := nil;
     End
     Else
     begin
        if newnode^.key < root^.key then
        begin
          if (root^.left<>nil) and (root^.Right=nil) then
          begin
             BackRoot:=root;
             Root:=root^.left;
             BackRoot^.left:=nil;
             Root^.right:=BackRoot;
          end;
          AddToTree(root^.left,newnode);
        end
        Else
        begin
          if (root^.Right<>nil) and (root^.left=nil) then
          begin
             BackRoot:=root;
             Root:=root^.right;
             BackRoot^.Right:=nil;
             Root^.Left:=BackRoot;
          end;
          AddToTree(root^.right,newnode);
        end;
     end;
End;


Procedure SearchTree(Root:TreePtrType; Target:word;
                   Var Position:Ptr; Var Depth:word);
Begin
     If root = nil then
        Position := nil
     Else
     Begin
          Depth := Depth+1;
          If root^.key = target then Position := root
          Else if target < root^.key then SearchTree(root^.left,target,position,depth)
          Else SearchTree(root^.right,target,position,depth);
     End;
End;

Procedure DeleteTree(var Root:TreePtrType; Target:word);
var DelRoot:TreePtrType;
Begin
     if (root <> nil) then
     begin
          If root^.key = target then
          begin
             DelRoot:=root;
             Root:=root^.left;
             if DelRoot^.Right<>nil then AddToTree(Root,DelRoot^.Right);
             Dispose(DelRoot);
          end
          Else if target < root^.key then DeleteTree(root^.left,target)
          Else DeleteTree(root^.right,target);
     End;
End;



Procedure PreOrder(Root:TreePtrType);
Begin
     If root <> nil then
     Begin
          Writeln(Root^.key);
          PreOrder(Root^.left);
          PreOrder(Root^.right);
     End;
End;


Procedure PostOrder(Root:TreePtrType);
Begin
     If root <> nil then
     Begin
          PostOrder(Root^.left);
          PostOrder(Root^.right);
          Writeln(Root^.key);
     End;          
End;


Procedure InOrder(Root:TreePtrType);
Begin
     If root <> nil then
     Begin
          InOrder(Root^.left);
          Writeln(Root^.key);
          InOrder(Root^.right);
     End;
End;


Procedure Screen(Var Choice:integer);
Begin
     clrscr;
     Writeln(' ');
     Writeln('1.     Initialise a tree');
     Writeln('2.     Add an item to a tree <a positive integer>');
     Writeln('3.     Search for an item in the tree');
     Writeln('4.     Preorder printout of tree');
     Writeln('5.     Postorder printout of tree');
     Writeln('6.     Inorder printout of tree');
     Writeln('7.     Display Tree');
     Writeln('8.     Delete Tree');
     Writeln('9.     Quit');
     Writeln;
     Write('Please enter your choice: ');
     Readln(choice);
     Writeln;
     If (Choice < 1) or (Choice > 9) then
     Begin
        Writeln('Only options 1 to 9 are available.');
        ReadLn(S);
     End;
End;



procedure OPenFile(FileName:String);
 var
   f: file of char;
   Ch:Char;
   S:string;
   key,Code:word;
begin
   InitTree(rootptr);
   Assign(f,FileName );
   Reset(f);
   while not Eof(F) do
   begin
     Read(F, ch);
     if ch in['0'..'9','.'] then S:=s+ch
     else
     begin
       if S<>'' then
       begin
         val(s,Key,Code);
         if Code=0 then
         begin
           New(nextnode);
           nextnode^.Key:=key;
           AddToTree(rootptr,nextnode);
         end;
         S:='';
       end;
     end
   end;
   Close(f);
end;


begin
   
     if ParamCount >0 then OPenFile(ParamStr(1));
     Repeat
           Screen(select);
           Case select of
                1 : InitTree(rootptr);
                2 : Begin
                      Writeln('Enter ',exitpro:1,' to stop.');
                      Write('Enter next data value or ',exitpro:1,' to stop.');
                      Readln(NewElement);
                      While NewElement <> exitpro do
                      begin
                        New(nextnode);
                        nextnode^.Key:=NewElement;
                        AddToTree(rootptr,nextnode);
                        Write('Enter next data value or ',exitpro:1,' to stop.');
                        Readln(NewElement);
                      end;
                    End;
                3 :begin
                    Write('Enter the number to be search:  ');
                    Readln(targettype);
                     SearchTree(rootptr,targettype,positionptr,depthtype);

                     str(targettype,S);

                     if positionptr<>nil then
                       Write('Find the number ('+S+') ')
                     else Write('Can''t Find the number ('+S+') ');
                   end;
                4 : Preorder(rootptr);
                5 : Postorder(rootptr);
                6 : Inorder(rootptr);
                7 :begin
                     clrscr;
                     displaytree(40,1,rootptr);
                     readln
                   end;
                8 :begin
                       
                        Write('Enter the data to be delete.');
                        Readln(NewElement);
                        DeleteTree(rootptr, NewElement);
                        Write('Data deleted.');
                        readln
                   end;
           End;
     Until select = 9;
end.

 

by: cipher007Posted on 2007-07-28 at 15:55:34ID: 19586326

The tree works fine with some bugs. Thanks
Bugs:* When a number is searched it cannot find some numbers. Hope you can resolve this.
          *Also when the tree is displayed the two main branches of the tree gets entangled at level 3.
          I know that as you go down the tree it will be harder to display the branches.... But atleast if you  
         can display upto level three without that issue I will be a happy man. :-)
I was wondering when a particular number is searched whether you could also show/display the searched path also. Fo instance lets say we search for 5 from the following tree.
                   4
                /        \
             2             6
          /     \         /     \
       1         3    5       7
The result should be
              4
                 \
                  6
                 /
              5
or may be in this format 4-->6--->5 or any other easier way for you. But this is how the program should search for number 5 from the tree. right?
The point here is to show how the requested data was retrieved from the tree.

Thank you for taking your time to help.

 

by: diniludPosted on 2007-07-30 at 07:41:20ID: 19592746

program BSearch1;


uses wincrt;

Const exitpro = -1;
Type
    Element = Word;

    Ptr = ^Nodetype;

    Nodetype = Record
               Key:Element;
               Left,Right:Ptr;
               End;

    Treeptrtype = Ptr;




Var Select:Integer;
    Rootptr:Treeptrtype;
    Targettype:Element;
    Positionptr:Ptr;
    Depthtype:Word;
    Newnodeptr:Treeptrtype;
    Nextnode:Treeptrtype;
    NewElement:Integer;
    S:string[11];
    result:string;


procedure DisplayTree(Distance,depth:Byte;Node:Treeptrtype;CurLvelDiff:integer);
var s:string;
   
begin
  if Node<>nil then
  begin
     str(Node^.key,s);
     gotoxy(Distance,depth);
     writeln(s);
     gotoxy(Distance-CurLvelDiff,depth+1);
     if Node^.left<>nil then  writeln('/');
     gotoxy(Distance+CurLvelDiff,depth+1);
     if Node^.right<>nil then  writeln('\');
     DisplayTree(Distance-(2*CurLvelDiff+2) ,depth+2,Node^.left,CurLvelDiff-1);
     DisplayTree(Distance+(2*CurLvelDiff+2),depth+2,Node^.right,CurLvelDiff-1);
  end;
end;


procedure FreeTree(var Root:TreePtrType);
begin
  if Root<>nil then
  begin
     FreeTree(Root^.Left);
     FreeTree(Root^.right);
     Dispose(Root);
  end;
end;

Procedure InitTree(Var Root:TreePtrType);
Begin
     FreeTree(Root);
     Root := nil;
     Writeln('The tree has been initialised.');
End;


Function TreeEmpty(Root:TreePtrType):boolean;
Begin
     TreeEmpty := (root = nil)
End;

{Procedure AddToTree(Var Root:TreePtrType; NewNode:TreePtrType);
var BackRoot:TreePtrType;
Begin

     If root = nil then
     Begin        
          Root := newnode;
          Root^.left := nil;
          Root^.right := nil;

     End
     Else if newnode^.key < root^.key then
             AddToTree(root^.left,newnode)
        Else AddToTree(root^.right,newnode);
End;}

Procedure AddToTree(Var Root:TreePtrType; NewNode:TreePtrType);
var BackRoot:TreePtrType;
Begin

     If root = nil then
     Begin
          Root := newnode;
          Root^.left := nil;
          Root^.right := nil;
     End
     Else
     begin
        if newnode^.key < root^.key then
        begin
          if (root^.left<>nil) and (root^.Right=nil) then
          begin
             BackRoot:=root;
             Root:=root^.left;
             BackRoot^.left:=nil;
             Root^.right:=BackRoot;
          end;
          AddToTree(root^.left,newnode);
        end
        Else
        begin
          if (root^.Right<>nil) and (root^.left=nil) then
          begin
             BackRoot:=root;
             Root:=root^.right;
             BackRoot^.Right:=nil;
             Root^.Left:=BackRoot;
          end;
          AddToTree(root^.right,newnode);
        end;
     end;
End;


Procedure SearchTree(Root:TreePtrType; Target:word;
                   Var Position:Ptr; Var Depth:word; Var Result:string);
var s:string;
Begin
     If root = nil then
        Position := nil
     Else
     Begin
          str(root^.key,s);
          Depth := Depth+1;
          If root^.key = target then
          begin
            Result:=Result+ s;
            Position := root
          end
          Else if target < root^.key then
          begin
            Result:=Result+ s+' <- ';
            SearchTree(root^.left,target,position,depth,Result);
          end
          Else
          begin
            Result:=Result+ s+' -> ';
            SearchTree(root^.right,target,position,depth,Result);
          end;
     End;
End;

Procedure DeleteTree(var Root:TreePtrType; Target:word);
var DelRoot:TreePtrType;
Begin
     if (root <> nil) then
     begin
          If root^.key = target then
          begin
             DelRoot:=root;
             Root:=root^.left;
             if DelRoot^.Right<>nil then AddToTree(Root,DelRoot^.Right);
             Dispose(DelRoot);
          end
          Else if target < root^.key then DeleteTree(root^.left,target)
          Else DeleteTree(root^.right,target);
     End;
End;



Procedure PreOrder(Root:TreePtrType);
Begin
     If root <> nil then
     Begin
          Writeln(Root^.key);
          PreOrder(Root^.left);
          PreOrder(Root^.right);
     End;
End;


Procedure PostOrder(Root:TreePtrType);
Begin
     If root <> nil then
     Begin
          PostOrder(Root^.left);
          PostOrder(Root^.right);
          Writeln(Root^.key);
     End;          
End;


Procedure InOrder(Root:TreePtrType);
Begin
     If root <> nil then
     Begin
          InOrder(Root^.left);
          Writeln(Root^.key);
          InOrder(Root^.right);
     End;
End;


Procedure Screen(Var Choice:integer);
Begin
     clrscr;
     Writeln(' ');
     Writeln('1.     Initialise a tree');
     Writeln('2.     Add an item to a tree <a positive integer>');
     Writeln('3.     Search for an item in the tree');
     Writeln('4.     Preorder printout of tree');
     Writeln('5.     Postorder printout of tree');
     Writeln('6.     Inorder printout of tree');
     Writeln('7.     Display Tree');
     Writeln('8.     Delete Tree');
     Writeln('9.     Quit');
     Writeln;
     Write('Please enter your choice: ');
     Readln(choice);
     Writeln;
     If (Choice < 1) or (Choice > 9) then
     Begin
        Writeln('Only options 1 to 9 are available.');
        ReadLn(S);
     End;
End;



procedure OPenFile(FileName:String);
 var
   f: file of char;
   Ch:Char;
   S:string;
   key,Code:word;
begin
   InitTree(rootptr);
   Assign(f,FileName );
   Reset(f);
   while not Eof(F) do
   begin
     Read(F, ch);
     if ch in['0'..'9','.'] then S:=s+ch
     else
     begin
       if S<>'' then
       begin
         val(s,Key,Code);
         if Code=0 then
         begin
           New(nextnode);
           nextnode^.Key:=key;
           AddToTree(rootptr,nextnode);
         end;
         S:='';
       end;
     end
   end;
   Close(f);
end;


begin
   
     {if ParamCount >0 then }OPenFile('C:\X.txt');
     Repeat
           Screen(select);
           Case select of
                1 : InitTree(rootptr);
                2 : Begin
                      Writeln('Enter ',exitpro:1,' to stop.');
                      Write('Enter next data value or ',exitpro:1,' to stop.');
                      Readln(NewElement);
                      While NewElement <> exitpro do
                      begin
                        New(nextnode);
                        nextnode^.Key:=NewElement;
                        AddToTree(rootptr,nextnode);
                        Write('Enter next data value or ',exitpro:1,' to stop.');
                        Readln(NewElement);
                      end;
                    End;
                3 :begin
                    Write('Enter the number to be search:  ');
                    Readln(targettype);
                     result:='';
                     positionptr:=nil;
                     SearchTree(rootptr,targettype,positionptr,depthtype,result);

                     str(targettype,S);

                     if positionptr<>nil then
                     begin
                       Writeln('Find the number ('+S+') ');
                       Writeln('Path = '+Result);
                     end
                     else Write('Can''t Find the number ('+S+') ');
                     readln;
                   end;
                4 : Preorder(rootptr);
                5 : Postorder(rootptr);
                6 : Inorder(rootptr);
                7 :begin
                     clrscr;
                     displaytree(40,1,rootptr,2);
                     readln
                   end;
                8 :begin
                       
                        Write('Enter the data to be delete.');
                        Readln(NewElement);
                        DeleteTree(rootptr, NewElement);
                        Write('Data deleted.');
                        readln
                   end;
           End;
     Until select = 9;
end.

 

by: cipher007Posted on 2007-07-31 at 08:29:47ID: 19601300

Thanks dinilud,

One question, though.
When accepting the answer how do I give you additional points.

 

by: diniludPosted on 2007-07-31 at 22:06:44ID: 19606383

No problem.
this points is enough for me

20120131-EE-VQP-002

3 Ways to Join

30-Day Free Trial

The Experts

98% positive feedback on 31,087 answers since March 2000. angeliii is a Microsoft Most Valuable Professional for his work with MS SQL Server & Develoment.

He has also proven his knowledge of Visual Basic Programming, PHP Scripting and Oracle Databases.

The Experts

97% positive feedback on 10,752 answers since July 2000. lrmoore has more than 18 years experience in the networking industry.

The six-time Mircosoft MVPs specialties include firewalls, virtual private networking, and network management.

Testimonials

"...and excellent source for support... Kind of like having your very own IT dept." Electriciansnet

Testimonials

"I was apprehensive at signing up at first. However... it has already made my life as an IT administrator much easier." JaCrews

Testimonials

"WOW! You guys have great, active, and knowledgeable people on here." moore50

Business Clients

Business Clients

In the Press

"If you’ve got a question... Experts Exchange can supply an answer.”

In the Press

"...an invaluable aid for both IT professionals and those who require tech support."

In the Press

"where IT professionals provide quick answers on just about any topic"

Business Account Plans

Loading Advertisement...