In the following binary tree (not a binary search tree) array/list representation, which value would be the parent of the 19?

Which statement best represents the action taken when removing an element from a binary search tree that has a single child? A) replacing it with its only child B) comparing the element with the root node C simply deleting it replacing it with a duplicate parent element

4. Complete the fuction definition given below that takes the root node of a tree as a parameter and returns the count of nodes. int count_nodes(Node *root){ // complete the function }

Please write the code in C. The screenshot attched provides the template to write in C.

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.

Please show all work for traversals and array representation.