In the above example, a simple hashmap or binary search tree could have easily solved the problem, but implementing one of these data structures in XSL would be inconvenient and unnecessary.

在上面的示例中，如果使用一个简单的散列图(hashmap)或二进制搜索树就可以轻易地解决问题，但是用XSL实现一个这样的数据结构并不是很方便，并且是不必要的。

youdao

By careful researches of the traversal of binary tree, a new method of traversing binary tree is brought forward, which is able to solve the problem of traversal of binary tree.

对二叉树的遍历过程进行深入地研究，提出一种生成二叉树遍历序列的新方法，解决了二叉树遍历序列的生成问题。

youdao

Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem.

用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。

youdao