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

Level order traversal of a rooted tree can be done by starting from the root and performing

  1. preorder traversal

  2. in-order traversal

  3. depth first search

  4. breadth first search

asked in DS by Veteran (69k points)
recategorized by | 746 views

2 Answers

+16 votes
Best answer

answer = option D

Breadth first seach.

answered by Loyal (3.3k points)
edited by
+4 votes
answered by Veteran (11.2k points)

Rishi yadav Does it mean that we don`t care about order in which nodes are there in level like left to right,
Because while implementing BFS we tend to go for adjacent node [order doesn`t matter].Is it same?

Basically in a tree we traverse from  left to right @saxena0612


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

33,593 questions
40,128 answers
114,021 comments
38,389 users