Consider inserting the following values into an empty binary…

Cоnsider inserting the fоllоwing vаlues into аn empty binаry search tree in the given order: 10, 4, 15, 2, 8, 12, 18, 6 Which of the following is the in-order traversal of the resulting tree?