No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
 | Hi, I am trying to implement a binary tree(not sorted) using recursion. I have figured out most of my function however GetMax and GetMin are confusing me. [CODE]#include <stdio.h> #include <stdlib.h> #include <limits.h> typedef int TreeEntry; typedef struct binary_tree_node { TreeEntry item; struct binary_tree_node * left; struct binary_tree_node * right; … |
| | [CODE=c]#include <stdlib.h> #include <stdio.h> #include <string.h> /* a structure that defines a string buffer */ typedef struct strbuf { char *contents; /* pointer to dynamically allocated buffer contents */ size_t length; /* number of characters in buffer (excluding '\0') */ } StringBuffer; /* function prototypes */ StringBuffer *strbuf_new(const char *cstr); … |