Description

Given graph: A-B, A-C, B-D, B-E, C-F. Adjacency list: A:[B,C], B:[A,D,E], C:[A,F], D:[B], E:[B], F:[C]. Task 1: 'Arrange DFS order starting from A' → [A, C, F, B, E, D] or [A, B, D, E, C, F] (depends on neighbor order). Task 2: 'Arrange BFS order starting from A' → [A, B, C, D, E, F] (level by level

Details