The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
489 views

Level order Traversal of a rooted Tree can be done by starting from root and performing:

  1. Breadth First Search
  2. Depth First Search
  3. Root Search
  4. Deep Search
asked in Programming by Veteran (115k points)
recategorized by | 489 views

2 Answers

0 votes
A.BFS
answered by Boss (26.3k points)
0 votes
Level Order Traversal is similar to Breadth First Search whereas Preorder Traversal is similar to Depth First Search

so answer is A
answered by (273 points)
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
48,691 questions
52,776 answers
183,437 comments
68,391 users