Computer Algorithms: Balancing a Binary Search Tree
The binary search tree is a very useful data structure, where searching can be significantly faster than searching into a linked list. However in some cases searching into a binary tree can be as slow as searching into a linked list and this mainly depends on the input sequence. Indeed in case the input is sorted the binary tree will seem much like a linked list and the search will be slow.
Read full article from Computer Algorithms: Balancing a Binary Search Tree
No comments:
Post a Comment