Rebuilding a BST into AVL
How will you rebuild a given BST into AVL which contains exactly the same
keys? The algorithm running time should be O(n) and its allowed to use
O(n) additional space. Any ideas? The whole pseudo-code is not necessary,
any idea or suggestion would be appreciated! Thanks!
No comments:
Post a Comment