实现队列和二进制搜索树 [英] implementing queues and binary search trees

问题描述

我想要一个简单的程序来在"c"编程中实现二进制搜索树.
并附有说明.
#define max表示什么..
带有解释...

i want a simple program for implementing binary search tree in ''c'' programming.
with explanation.
what is #define max indicate..
with explanation...

推荐答案

#define max通知编译器该名称具有定义，但没有特定值.它可以用来告诉编译器生成或不生成程序的一部分.

我想您剩下的问题都与您要尝试的作业有关.

#define max informs the compiler that the name has a definition but no specific value. It can be used to tell the compiler to generate or not generate parts of the program.

I guess the rest of your question pertains to your homework which you will have to try yourself.

这里有几个链接:
这将有助于解释#define max: C预处理器 [ Gtk + Project [ ^ ]-我希望您可以找到一种有用的实现平衡二叉树 [

Here is a couple of links:
This will help to explain #define max: C preprocessor[^]

I think it''s useful to take a look at production quality code when you are learning to code - like glib at the Gtk+ Project[^] - there is an implementation that I hope you''ll find useful Balanced Binary Trees[^]


Best regards
Espen Harlinn

在Internet上进行搜索，您会发现大量示例和实现这些算法的算法.
我建议您在实施任何内容之前先读一本书并阅读算法，以帮助您入门.

Do a search on the internet you should find tons of samples and algorithms that implement these algorithms.
I would recommend you pick up a book and read up on algorithms before implementing anything, just to help you get started.

这篇关于实现队列和二进制搜索树的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！