Level order traversal of a rooted tree can be done by | Tree | Data Structure | GATE 2004

preview_player
Показать описание
SUBSCRIBE to Ankit Verma!

Tree | Data Structure | GATE CSE IT 2004

Level order traversal of a rooted tree can be done by starting from the root and performing
(A) preorder traversal
(B) inorder traversal
(C) depth first search
(D) breadth first search

Answer: (D)
Рекомендации по теме