我已经用c完成了一棵红黑树,我发现很难按级别顺序打印它。我有一个print-inorder,但是我不能想象我应该如何在控制台print中将它显示为一个树。这可行吗?我们可以在这里实现BFS或DFS吗?我在wiki中找到了一个算法,但我不能应用它。如果有人有用C语言编写的代码,你可以把它贴在这里,这样我就可以研究它了吗?来自wiki:
levelorder(root)
q = empty queue
q.enqueue(root)
while not q.empty do
node := q.dequeue()
visit(node)
if node.lef
当我开始学习如何测试一个程序时,我学到的就是用与测试程序相同的语言使用一个库或包。例如,
- if a tested program is written in Python, its testing program is also written in Python and uses `UnitTest` class in the python standard library
- if a tested program is written in C++, its testing program is also written in C++ and uses some test