关于二叉搜索树的项目? [英] project about binary search tree?

查看:68
本文介绍了关于二叉搜索树的项目?的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述


可以帮助我
我需要用Java编写二进制搜索树的代码.
该代码应执行以下操作:
在树中插入元素
搜索元素
找到最小元素
找到最大元素


因为我将计算此代码的效率,然后将其与其他数据结构进行比较
我希望获得代码?
谢谢您.


can help me
i need code in java for binary search tree.
the code should perform following operation :
insert element in tree
search for element
find minimum element
find maximum element


because i will calculate the efficiency for this code then compare this with other data structure
i hope to get the code ??
thank you

推荐答案

我们不做您的作业:这是有原因的.在这里,您可以考虑自己被告知的内容,并尝试理解它.也可以在那里帮助您的导师识别您的弱点,并将更多的注意力放在补救措施上.

自己尝试一下,您可能会发现它毕竟很简单.
We do not do your homework: it is set for a reason. It is there so that you think about what you have been told, and try to understand it. It is also there so that your tutor can identify areas where you are weak, and focus more attention on remedial action.

Try it yourself, you may find it is pretty simple after all.


看看是否 [ ^ ]帮助.


请尝试 google.com .他们有这个新的花哨的文本输入.
非常酷,因为您甚至不需要键入完整的"Java二进制搜索树".
如果您感到有些意外,请尝试我感到很幸运"按钮.我上次去了,不得不走了几个小时;)
please try google.com. They have this new fancy text input.
Totally cool, because you don''t even need to type the complete "Java binary search tree".
And if you are open for some surprise - try the "I feel lucky" button. I did last time and I had to lough for hours ;)


这篇关于关于二叉搜索树的项目?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆