CS301- Data Structures VU Midterm Current Paper (May 2011)

2 questions of 5 marks

a) a BST was given, the question is to do pre order and post order traversal

b) an AVL tree was given, the question was to find the balance factor of each node

70% MCQs were from trees, remaining were from stack and linked list