@navin : +1
On 6/30/12, Navin Gupta wrote:
> An unbalanced BST can be converted to a balanced BST in following 2-steps.
>
> 1:- Convert the tree to sorted circular doubly linked list.
> http://www.leetcode.com/2010/11/convert-binary-search-tree-bst-to.html
> The left children points to previou
An unbalanced BST can be converted to a balanced BST in following 2-steps.
1:- Convert the tree to sorted circular doubly linked list.
http://www.leetcode.com/2010/11/convert-binary-search-tree-bst-to.html
The left children points to previous element and right children points
to next elemen
