Last active
August 29, 2015 14:00
-
-
Save jitsceait/13f2acb9e05084b4d1bb to your computer and use it in GitHub Desktop.
This program converts a BST to linked list
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
#include<stdlib.h> | |
#include<math.h> | |
struct node{ | |
int value; | |
struct node *left; | |
struct node *right; | |
}; | |
typedef struct node Node; | |
void treetoListRec(Node * node, Node ** last, Node **ptrToHead){ | |
if(node == NULL) | |
return; | |
/* Go to left most child */ | |
if(node->left) | |
treetoListRec(node->left, last, ptrToHead); | |
/* If this wasn't the first node being added to list*/ | |
if(*last != NULL){ | |
(*last)->right = node; | |
} | |
else{ | |
*ptrToHead = node; | |
} | |
/*make left pointer point to last node, and update the | |
last node to current*/ | |
node->left = *last; | |
*last = node; | |
/* If there is right child, process right child */ | |
if(node->right) | |
treetoListRec(node->right, last, ptrToHead); | |
} | |
Node * create_node(int value){ | |
Node * temp = (Node *)malloc(sizeof(Node)); | |
temp->value = value; | |
temp->right= NULL; | |
temp->left = NULL; | |
return temp; | |
} | |
Node * addNode(Node *node, int value){ | |
if(node == NULL){ | |
return create_node(value); | |
} | |
else{ | |
if (node->value > value){ | |
node->left = addNode(node->left, value); | |
} | |
else{ | |
node->right = addNode(node->right, value); | |
} | |
} | |
return node; | |
} | |
/* Driver program for the function written above */ | |
int main(){ | |
Node *root = NULL; | |
Node * last = NULL; | |
Node *ptrToHead = NULL; | |
//Creating a binary tree | |
root = addNode(root,30); | |
root = addNode(root,20); | |
root = addNode(root,15); | |
root = addNode(root,25); | |
root = addNode(root,40); | |
root = addNode(root,37); | |
root = addNode(root,45); | |
treetoListRec(root,&last, &ptrToHead); | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment