# Binary Trees in Pascal

Can someone write a binary tree program in Pascal so that I don't have to please?  It has to be impressive so it makes me look good.
###### Who is Participating?

Commented:
Give me your e-mail, and i send it to you - i have a couple of this.
0

Commented:
Talk about honesty!  This site isn't for people to HOMEWORK for others.  You should try to do this yourself and then ask for help on the parts you are having problems with.

Otherwise, find someone local to you who you can pay.
0

Commented:
kelly's right
0

Commented:
its easy , try it.

0

Commented:
In order to grasp the concept of binary trees, you have to do it yourself.  It is one of the most complex data structures.
0

Commented:
The most interesting thing in programming is to solv your porblems by your self.

Data structure is the most interesting field in computer science specially when we understand it.

Motaz from Sudan.
0

Commented:
Just accept jack_p50's answer and get source code. No matter what all others tell you, if you just need programs for your work (you have no time, not interesting in data structure but have to work with it, I suppose). But if you want to understand algorithms, you have to do it yourself, without or with a little help from others.
Anyway, I have tell you that I'm totally sad here.
0

Commented:
Daitt: it is clearly homework.
0

Commented:
Hey, what's a binary tree and what it is needed for??

Vik
0

Commented:
It is a data structure like a linked list, except each node has two links.  There are many uses for binary trees...3-d games use them, mathematical parsers uses them...
0

Commented:
Ya, Kevin....Can you show me a simple example.... If you decide to give me an example, you could do it by mail ;-)

Cheers,
Viktor
0

Commented:
Here is a very simple way of coding a binary tree:

type
PNode = ^TNode;
TNode = record
Value :Integer;
Left  :PNode;
Right :PNode;
end;

var a,b,c,d,e,f,g,h :PNode;
begin
New(b);
New(c);
New(a);
a^.Left := b;
a^.Right := c;
New(d);
New(e);
d^.Left := a;
d^.Right := e;
New(f);
e^.Left := f;
New(g);
b^.Left := g;
New(h);
c^.Right := h;
...
...
end.

This would create a tree that looks like this:
________________D
_______________/_\
______________/___\
_____________A_____E
____________/_\___/
___________B___C_F
__________/_____\
_________G_______H

I used the underscores to make sure everything lines up OK.

0

Commented:
Vik:   that still looks screwed up, even though I used underscores.  Copy and paste that into the "Have a comment to..." box to look at it in the Courier font.
0

Commented:
I just pasted it in Notepad, and it looks very pretty ;-)

I've seen this kinda stuff somewhere... Is that how databases are done??? Kinda???

btw- Thanks for the example :-)

Vik
0

Commented:
Databases don't *normally* use trees, but they could.
0

Commented:
Here's somewhat of a tutorial on binary trees:

It's in java however.
0

Commented:
0

Commented:
Trees can be used for expression evaluators
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.