AVL Tree $(3$ Points$)$

Pre$-$order

$1.$ Root,

$2.$ Left Subtree,

$3.$ Right Subtree

$$ Write a program that will have pre defined input as numbers $(1,2,3,4,5)$

$$ Then program will first create a BST of the input and print that out $($pre$-$order, as an array$)$

$$ Then the program will balance the BST and print out the AVL tree $($pre$-$order, as an array$)$

$$ Steps

$$ Create BST and printing out its pre$-$order

$$ Balance the BST tree and printing out its pre$-$order $($i$.$e$.$ AVL tree$)$

$$ Output:

$$ Print BST Pre$-$order $(1\mathrm{.}5-$point$)$

$$ Print Balanced$-$AVL Pre$-$order $(1\mathrm{.}5-$point$)$