Prove that a sequence of increasing find operations on a splay tree takes $mathcal{O}(n)$ time
Channel: Roel Van de Paar
Date: 13/08/2021

Prove that a sequence of increasing find operations on a splay tree takes $mathcal{O}(n)$ time

Helpful?  Please support me on Patreon: https://www.patreon.com/roelvandepaar

With thanks & praise to God, and with thanks to the many people who have made this project possible! | Content (except music & images) licensed under CC BY-SA https://meta.stackexchange.com/help/licensing | Music: https://www.bensound.com/licensing | Images: https://stocksnap.io/license & others | With thanks to user Wanderer (cs.stackexchange.com/users/17363), user John L. (cs.stackexchange.com/users/91753), and the Stack Exchange Network (cs.stackexchange.com/questions/103602). Trademarks are property of their respective owners. Disclaimer: All information is provided "AS IS" without warranty of any kind. You are responsible for your own actions. Please contact me if anything is amiss at Roel D.OT VandePaar A.T gmail.com