
March 30th, 2002, 01:20 PM
|
|
Registered User
|
|
Join Date: Mar 2002
Posts: 20
Time spent in forums: < 1 sec
Reputation Power: 0
|
|
|
I suppose I don't really understand the problem.
In a simple binary tree, copying the winner of a match to the parent (discard the children if you want) as can be seen in every display of tournaments should do the job:
e.g
x means empty
quaterfinals
x
x x
x x x x
a b c d e f g h
a wins against b
d wins against c
e wins against f
g wins against h
Semifinals
x
x x
a d e g
a b c d e f g h
d wins against a
e wins against g
Finals
x
d e
a d e g
a b c d e f g h
d wins against e
d
d e
a d e g
a b c d e f g h
So a simple fully balanced binary tree with a depth first access should do the job!?!
|