UGC/CBSE NET SOLVED QUESTION PAPERS.(Computer Science)
Monday, 14 December 2015
Q23, P2,J15. Level order traversal of a rooted tree can be done by starting from root and performin
A) Bradth first search. B) Depth first search C) root search D) Deep serach.
Answer A.
No comments:
Post a Comment
Note: only a member of this blog may post a comment.
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment
Note: only a member of this blog may post a comment.