Here I'm sharing my code. This is for the extra problem in lab#8. I found it soooo interesting to use Stack data structure to avoid using recursion. It's so clever to do so but I'm not sure which one is more efficient.
This is also the code for lab#8 BST_rec1.That's not challenging, so do the other two tasks in lab#8.
In my point of view, tree is a very interesting and useful data structure. But sometimes I can't fully understand my own code even if the program can run properly without error. But anyway, we don't have to trace recursion, which is a very silly thing to do.
No comments:
Post a Comment