问题描述
大家好
我正在使用C ++程序.它的一部分要求我使用元素的二进制搜索树预排序.我有一个带线的字符串数组，用于生物医学实体.将这些实体插入此bst之后，需要使用它们.
由于我不是来自CS背景，因此在一定的时间范围内，这似乎超出了我的范围.因此，如果有一些片段可以处理字符串数组的输出，我可以继续进一步处理我的程序.因此，如果有人可以提供帮助，我可能需要两个函数片段，一个是将我拥有的具有40个元素的字符串数组作为它们的出现插入到树中.第二部分将显示这些节点的预遍历.
我希望我对C专家的要求不高.
Hi all
I am working on a C++ program. A part of it requires that i use binary search tree preorder of the elements. I have a string array with lines for biomedical entities. These entities need to be used after they are inserted in this bst.
Since i am not from CS background, it seemed a bit out of my bounds given the time frame i have. So if there is some snippet that can process the string array output , i can move on to further process the program of mine. So i might need two function snippets if someone can help, one would be to take this string array with 40 elements that i have and insert them in the tree as their occurrence. Second part wold be to display the preorder traversal of those nodes.
I hope i am not demanding much with c gurus over here.
推荐答案
这篇关于将字符串数组解析为预购BST的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！