- Joined
- Sep 4, 2010
- Messages
- 1
- Reaction score
- 0
A doubly linked list with ordered nodes(increasing order) is a SKEWED BST. How can we change it into (inplace)balanced BST .
make a function which returns the middle of the LL
middle(node *)
now find the remaining solution at
cracktheinterview.org/2010/08/doubly-linked-list-to-bst-inplace/
make a function which returns the middle of the LL
middle(node *)
now find the remaining solution at
cracktheinterview.org/2010/08/doubly-linked-list-to-bst-inplace/