In a binary search tree, which traversal method ensures that the nodes are visited in ascending order?A$)$ PreorderB$)$ InorderC$)$ PostorderD$)$ Level$-$order