Given a binary search tree whose level order traversal is: 34 31 57 23 35 97 27 49 94 42 71 76, what is the level order traversal of the resulting binary search tree after Hibbard deleting the following 3 keys: 42 23 57 (Note: Hibbard deletion of a node with 2 children replaces that node with its successor from the right hand side!)