help with AVL tree
Name:
exoneo
2008-11-18 19:39
hi,could somebody help me to make a AVL tree in C language?
it needs to do the following functions:
search, add, delete, inorder, postorder, preorder
Name:
Anonymous
2008-11-18 19:43
No. We don't like AVL trees here.
Name:
Anonymous
2008-11-18 19:47
Pedestrian and uninspired.
Name:
Anonymous
2008-11-18 21:14
do your own fucking homework
Name:
Anonymous
2008-11-18 22:56
Aw, how cute. He's got a cool handle and everything!
Name:
Anonymous
2008-11-18 23:19
I fucking loled at
>>5 even though I'm not particularly one that usually would lol at such a girly comment.
Name:
Anonymous
2008-11-19 1:18
>>5,6
Gee willikers! It sure is same person around here!
Name:
Anonymous
2008-11-19 5:26
C can't do AVL trees you need FIOC
Name:
Anonymous
2008-11-19 10:14
>>1
You are asking the wrong question. Instead, you want to make a
skip list.
But we won't help you anyway.
Name:
Anonymous
2008-11-19 10:47
>>1
You are asking the wrong question. Instead, you want to make a
sicp list.
Read SICP.
Name:
Anonymous
2008-11-19 11:17
>>1
Search, in order, pre order, and post order are the same in all binary trees. Only insert and delete are different.
There, I answered 2/3 of your question.
Name:
Anonymous
2008-11-19 15:13
Name:
Anonymous
2008-11-19 17:13
>>12
Whatever,
I'll do what I want!
Name:
exoneo
2008-11-19 23:27
today i failed to complete the AVL tree program.
i couldn't keep the damn thing balanced,
thank you for your help and motivation!
KTHXBYE
Name:
Anonymous
2008-11-19 23:41
>>14
This is the best post
/prog/ has seen in many a fortnight.
Name:
Anonymous
2008-11-19 23:44
Ah yes, they always start posting on message boards for help exactly one day before deadline.
Name:
Anonymous
2008-11-19 23:46
Name:
Anonymous
2008-11-20 5:19
djestka
Name:
Anonymous
2008-11-20 8:13
Dyke straw