'Bst deletion' presentation slideshows

Lecture 22: The Rolling Stones, Masters of the Balanced Tree

532 views • 41 slides

BST Search

BST Search. To find a value in a BST search from the root node: If the target is less than the value in the node search its left subtree If the target is greater than the value in the node search its right subtree Otherwise return data, etc.

277 views • 21 slides

Fundamentals of Algorithms MCS - 2 Lecture # 17

Fundamentals of Algorithms MCS - 2 Lecture # 17. Binary Search Trees. BST Finding Maximum Pseudo code. Following right child pointers from the root, until a NIL is encountered. TREE-MAXIMUM(x ) 1 while right [x] ? NIL 2 do x ? right [x] 3 return x

236 views • 11 slides