Fill up the Tree
Enter 6 String values, one per line
Use ctrd_d or blank line to terminate input
The Tree status after the initial fill up
A
B
C
D
E
F
InOrder: a b c d e f
PreOrder: d b a c e f
PostOrder: a c b f e d
Lowest value in the Tree is: a
Highest value in the Tree is: f
Search for value x in the Tree: Not Found!!
The Tree status after 2 removals & 1 insertion
InOrder: b c e f x
PreOrder: e b c f x
PostOrder: c b x f e
Lowest value in the Tree is: b
Highest value in the Tree is: x
Search for value x in the Tree: Yes, x is in the Tree!
[Ovu poruku je menjao veljaradenkovic dana 29.11.2004. u 11:27 GMT+1]
[Ovu poruku je menjao veljaradenkovic dana 29.11.2004. u 11:29 GMT+1]