Question 17 1 pts BST insertion involves: O finding the first node having less than two descendents O finding the first node having 0 descendants O inserting a node in such a way that all left sub-tree values are always smaller than all right-tree sub-tree values on all levels O either a) or b) Question 18 1 pts If the following values are inserted into a binary search tree 1,2,3,4,5,6,7,8 the sorted binary tree will deteriorate into a array O singly linked list O doubly linked list O neither