Explain different methods in which you can traverse a tree?
- 1 Answers
- 1021 Views
- NIIT, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Write a program for Sorting an Array. Which sorting will you prefer?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
Can you declare an array without assigning the size of an array?
What sort of serious problems have you experienced, and how have you handled them?
