Explain different methods in which you can traverse a tree?
- 1 Answers
- 1020 Views
- NIIT, I also Faced
- E-Mail Answers
Answer / Ravindra Verma
There are several methods of traversing a tree: 1) Depth-First Search (DFS): This method explores as far as possible along each branch before backtracking. There are two types of DFS: DFS by recursion and DFS using stack. 2) Breadth-First Search (BFS): This method explores all the nodes at a given depth level before moving on to the next level. It uses a queue for traversal. 3) Topological Sort: This method is used for directed acyclic graphs (DAGs).
| Is This Answer Correct ? | 0 Yes | 0 No |
What is a static structure?
How is heap sort implemented?
What is concept of data structure?
Is vector a collection?
How much time does it take to learn data structures?
What is time complexity of quick sort?
How do you empty an arraylist?
How can a binary tree be represented using the rotation?
Why do we Use a Multidimensional Array?
In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none
Can we put null key in hashmap?
In what order the elements of a hashset are retrieved?
Windows 
