Data Structures

1: Traversing a binary tree first root and then left and right subtrees called _______traversal.

A.	postorder
B.	preorder
C.	inorder
D.	none of these
	Answer : B Explanation : Write your comments here: Updating your Comments.. Updating your Comments.. Report Error
	Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.

UGC NET Paper 1 UGC NET Computer Science UGC NET Exam GATE Exam Aptitude Viva Questions General Knowledge Computer Questions Online Test

Suggest an improvement