Which below are true? (select all that are true) A) Inserting keys in random order into a Binary Search Tree will guarantee a perfect Binary Tree. B) There is a unique Binary Search Tree that stores nodes of a given a set of keys. C) A Binary Search Tree will give faster retrieval times than a simple list. D) Inserting keys in sorted order will give the best performance from a Binary Search Tree. E) None of the Above

Draw all possible binary search trees with the values 1, 2, 3, and 4.

Course: Data Structure and Algorithms Language: Java Topic: AVL Tree Kindly solve this question prperly step by step and complete.   AVL Tree basics Draw the AVL tree after performing each of the following operations consecutively on an initially empty binary search tree: insert 8, insert 6, insert 12, insert 3, insert 10, insert 9, delete 12, delete 8, insert 7, insert 8.  If you delete an item from an AVL tree and then insert it back into the tree, will you always get back the original AVL tree? Justify your answer.

5. Draw the final binary search tree that results after inserting the following keys in the order they appear here: 24 18 67 68 69 25 19 20 11 93