search

OccupyMars2025 / Introduction-to-Algorithms-4th-Edition

Time is Money, Efficiency is Life
MIT License
1 stars 0 forks source link

[solved][amazing solution][ch12, binary search trees] k successive calls to TREE-SUCCESSOR take O(k+h) time #6

Closed OccupyMars2025 closed 5 months ago

OccupyMars2025 commented 5 months ago

solution: https://stackoverflow.com/questions/68750120/prove-that-k-successive-calls-to-tree-successor-take-ok-h-time

IMG_20240530_160409