2 votes 2 votes Level order Traversal of a rooted Tree can be done by starting from root and performing: Breadth First Search Depth First Search Root Search Deep Search Programming in C ugcnetcse-june2015-paper2 data-structures tree-traversal + – go_editor asked Jul 30, 2016 • recategorized Nov 1, 2017 by Sanjay Sharma go_editor 2.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Level Order Traversal is similar to Breadth First Search whereas Preorder Traversal is similar to Depth First Search so answer is A Prateek Thakral answered Oct 23, 2017 Prateek Thakral comment Share Follow See all 0 reply Please log in or register to add a comment.