Displaying 2 results from an estimated 2 matches for "make_tree".
2005 Apr 26
2
[LLVMdev] How to avoid this transformation
...ee
{
int data;
struct bintree *Left;
struct bintree *Right;
};
void inorder_traversal(struct bintree *node)
{
if (node->Left != 0) inorder_traversal( node->Left );
printf("%d\t", node->data);
if (node->Right != 0) inorder_traversal( node->Right );
}
struct bintree *make_tree(int level)
{
struct bintree *New = malloc ( sizeof ( struct bintree ) );
New->Left = level ? make_tree (level-1) : 0;
New->data = level;
New->Right = level ? make_tree (level-1) : 0;
return New;
}
int main()
{
struct bintree *root;
root = make_tree(1000);
printf("\n");...
2005 Apr 26
0
[LLVMdev] How to avoid this transformation
...intree *Right;
> };
>
> void inorder_traversal(struct bintree *node)
> {
> if (node->Left != 0) inorder_traversal( node->Left );
> printf("%d\t", node->data);
> if (node->Right != 0) inorder_traversal( node->Right );
> }
>
> struct bintree *make_tree(int level)
> {
> struct bintree *New = malloc ( sizeof ( struct bintree ) );
> New->Left = level ? make_tree (level-1) : 0;
> New->data = level;
> New->Right = level ? make_tree (level-1) : 0;
> return New;
> }
>
> int main()
> {
> struct bintree *r...