Up to a point, it is better to just let the snags [bugs] be there than to spend such time in design that there are none. Alan M. Turing

In-place conversion of Sorted DLL to Balanced BST

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


Data structure Description

Convert from In-place conversion of Sorted doubly linked list to Balanced Binary search Tree.


Output

   					 

All Binary Tree Values: 1  2  3  4  
All Linked list Values: 1->2->3->4->NULL

				    

Comments


No comments available!

Please login to add comments.