Given the following tree traversal methods: Pre-order: Visi…
Given the following tree traversal methods: Pre-order: Visit the root first, then recursively visit all subtrees. In-order (binary tree): Visit the Left subtree, root, then the right subtree. Post-order: Recursively visit all subtrees, then visit the root. For each of the following scenarios, select the most appropriate tree traversal method to achieve the desired outcome: A binary search tree stores player scores in its nodes. You want to display scores in ascending order. A tree represents a file system hierarchy. You want to display the file system structure starting from the root, including all subdirectories and files, mirroring the natural hierarchical listing and exploration of files. A tree represents a file system hierarchy. You want to calculate the total size of a directory, including its subdirectories and files. In Java, garbage collection automatically reclaims memory occupied by objects that are no longer referenced. A tree is used to manage object references, where each node represents an object, and each object can reference other objects. You want to safely delete an object along with all objects it references.