There are two ways of constructing a software design. One way is to make it so simple that there are obviously no deficiencies. And the other way is to make it so complicated that there are no obvious deficiencies. C.A.R. Hoare

BST to LinkedList

Language Java | Level Intermediate | Category Data structure | September 8, 2015 8:04 am


Data structure Description

Write a program to convert Binary Search Tree to Linked list.


Output

   					 

All Binary Tree Values: -13  6  7  
Print the Linked list values:-13->6->7->NULL
Linked list head data:-13
Linked list tail data:7

				    

Comments


No comments available!

Please login to add comments.