Question: If you wanted to traverse a tree, writing all the elements to a file, and then, the next time you ran the program, rebuild the
If you wanted to traverse a tree, writing all the elements to a file, and then, the next time you ran the program, rebuild the tree by reading and inserting, would an inorder traversal be appropriate?
Why or why not?
Step by Step Solution
3.37 Rating (163 Votes )
There are 3 Steps involved in it
An inorder traversal of a binary tree might not be the best option for this case and here is the rea... View full answer
Get step-by-step solutions from verified subject matter experts
