binary-tree1.c

#include <stdio.h>

struct node 
{ 
	int data; 
	struct node *left; 
	struct node *right; 
};

typedef struct node * NODE;

struct node* newNode(int data) 
{

struct node* node = (struct node*)malloc(sizeof(struct node));

node->data = data;

node->left = NULL; 
node->right = NULL; 
return(node); 
}


void display(NODE root, int level){

	if(root == NULL) return;

	display(root->right, level + 1);

	for(int i = 0; i < level; i++) printf(" ");

	printf("%d\n", root->data);

	display(root->left, level + 1);

}
int main() 
{

struct node *root = newNode(1);

root->left	 = newNode(2); 
root->right	 = newNode(3);

root->left->left = newNode(4);

display(root, 0);

getchar(); 
return 0; 
}


/*
OUTPUT:


 3                                                                                                                                                                                    
1                                                                                                                                                                                     
 2                                                                                                                                                                                    
  4 

*/