Answer Happy

For the following binary search tree, what could be a level-order traversal sequence after deleting the node with key value = 3? Level order traversal means visit nodes from top level from bottom level, and each level visit from left to right. For example, the level order traversal for the following tree is: 8,3,10,1,6,14,4,7,13. 8 3 10 1 6 (14) 4 7 (13) 8, 4, 10, 1, 6, 14, 7, 13 8, 7, 10, 1, 6, 14, 4, 13 8, 4, 10, 6, 1, 14, 7, 13 8, 6, 10, 1, 4, 7, 14, 13