Revision #47 → #1040 · back to history
addedBinary search tree45f521eeaca2
addedTime complexity linear in tree height4c1c27c0e7ca
addedLogarithmic lookup performanceb90887cf4d50
addedAverage and worst-case complexity50196460d94c
addedBinary search tree (strict total order)8acfc09b68f8
addedWorst-case degeneracy to linked list5db36c92f4a2
addedSearch procedure6e1d4a5b3fb4
addedBST search running time7baff45a5deb
addedSuccessor of a node8e8bb0415d74
addedPredecessor of a node2ad5837b1db5
addedNew nodes inserted as leavesf2f787035ee6
addedDeletion case: leaf node37d5ffb8947a
addedDeletion case: one child63af5a7a307c
addedDeletion case: two childrenaff2e5993393
addedInorder tree walk482f8e198a28
addedInorder walk yields non-decreasing order697628c281ae
addedPreorder tree walka537e9eaa089
addedPostorder tree walk71ed6049529b
addedDegeneration without rebalancing4059896aa303
addedHeight-balanced treea40abd90554c
addedWeight-balanced tree972ad5304a64
addedTree sort93ff8778e276
addedAscending priority queue removal5cc461c876de
addedDescending priority queue removalbbc4ee3cc756