Convert a doubly linked list to a binary search tree in place.
Iteratively insert the number into the linked list, note in-place execution
Use two pointers, one is used to maintain bst, the other is use to maintain linked list.
Code will be added
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment