Discussion:
TRAVERSING A BINARY TREE ............................... [ADVENTURE GAME STYLE]
(too old to reply)
g***@gmail.com
2020-07-31 23:21:29 UTC
Permalink
www.miniBASE.com
GAME


POINTS 0

you are at 1
you can [go 0] [go 3] [go 4]



0
| \
1 2
|\
34
Jens Kallup
2020-08-01 16:10:07 UTC
Permalink
Post by g***@gmail.com
www.miniBASE.com
GAME
POINTS 0
you are at 1
you can [go 0] [go 3] [go 4]
0
| \
1 2
|\
34
no, because:

0
| \
1 2
/ \
3 4
g***@gmail.com
2020-08-02 01:27:23 UTC
Permalink
Post by g***@gmail.com
www.miniBASE.com
GAME
POINTS 0
you are at 1
you can [go 0] [go 3] [go 4]
0
| \
1 2
|\
34
0
| \
1 2
/ \
3 4
Here is a MECHANIC APP using Fault TREES

http://minibase.com/index.php?text1=go+mechanic+_

see if u can FIX the BATTERY
Jens Kallup
2020-08-02 02:20:18 UTC
Permalink
Post by g***@gmail.com
Here is a MECHANIC APP using Fault TREES
http://minibase.com/index.php?text1=go+mechanic+_
see if u can FIX the BATTERY
stupid question.
i am at position 1, and the solution is, go to 1.
But, the question topic is traversing a binary tree.
something turkey?

Fact is, the graph is displayed/created in wrong style,
so your "you can" go 3 / go 4 are completely confused.

Please tell your story, and make a story or article
text, not so stupid floods with stupid prolog.

Jens
Jens Kallup
2020-08-02 02:21:52 UTC
Permalink
Post by Jens Kallup
i am at position 1, and the solution is, go to 1.
woops, sorry, typo:

go to 0, to go 1.
something stupid German "go to cofe" haha.

Jens

Loading...