User Tools

Site Tools


Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Next revision
Previous revision
binary_search_tree [2014/07/19 21:50]
will created
binary_search_tree [2015/02/02 08:28] (current)
Line 4: Line 4:
  
 The shape of a binary search tree depends on the order of insertions and it can be degenerate. More complex data structures like AVL-trees or red-black trees are self balancing binary search trees and ensure that the shape does not become degenerate leading to worst case run times. The shape of a binary search tree depends on the order of insertions and it can be degenerate. More complex data structures like AVL-trees or red-black trees are self balancing binary search trees and ensure that the shape does not become degenerate leading to worst case run times.
 +
 +Binary search trees have very fast insertion and deletion when balanced, and the code is a lot simpler than other self balancing binary search trees.
  
 ===== Properties ===== ===== Properties =====
binary_search_tree.txt ยท Last modified: 2015/02/02 08:28 (external edit)