Note 1

Take Note:

Take a note while surfing.

Note With Ink

Give your Note a Colorful Tag.

Easy to Access

Stay on same information and in Sync wherever you are.

Note 2

Take Note:

Organize your information,It may take Shape.

Think With Ink

Differ your Content by Color.

Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3

Take Note:

Don't Let information to miss,Because it take shape

Note With Ink

Simple an Easy Way to take a note.

Easy to Access

Get the same in next visit.

Please wait...

Program Discussion :: Trees
Home > Programs > Trees

47. Write a program to delete the given tree


/* A binary tree node has data, pointer to left child 
and a pointer to right child */
struct node 
    int data;
    struct node* left;
    struct node* right;
/* Helper function that allocates a new node with the
given data and NULL left and right pointers. */
struct node* newNode(int data) 
    struct node* node = (struct node*)malloc(sizeof(struct node));
    node->data = data;
    node->left = NULL;
    node->right = NULL; 
/* This function traverses tree in post order to 
    to delete each and every node of the tree */
void deleteTree(struct node* node) 
    if (node == NULL) return;
    /* first delete both subtrees */
    /* then delete the node */
    printf("\n Deleting node: %d", node->data);

/* Driver program to test deleteTree function*/
int main()
    struct node *root = newNode(1); 
    root->left         = newNode(2);
    root->right         = newNode(3);
    root->left->left     = newNode(4);
    root->left->right = newNode(5); 
    root = NULL;
    printf("\n Tree deleted ");
    return 0;

Asked In ::

Post Your Answer Here:

Name *


Post Your Reply Here: