BCA Semester 3 – Data Structure and Algorithms – Unit 7: Trees (5Hrs)

Question 1

Draw a BST from the string DATASTRUCTURE and traverse the tree in post order and preorder.

Marks: 5

Year: 2019 Final TU FOHSS

Binary Search Tree of the string DATASTRUCTURE Assumption: - Characters are inserted from left to right. - The BST is ordered alphabetically. - Duplicate characters are ignored (only the first occur

Question 2

Define AVL tree. Construct AVL tree from given data set:$4, 6, 12, 9, 5, 2, 13, 8, 3, 7, 11.$

Marks: 5

Year: 2019 Final TU FOHSS

AVL Tree Definition An AVL tree is a self-balancing Binary Search Tree (BST) in which, for every node, the balance factor \[ \text{Balance Factor} = \text{Height of Left Subtree} - \text{Height of