13:["$","div",null,{"className":"Post_post__BuG2d","style":{"display":"flex","flexDirection":"column","alignItems":"center","gap":"8px","flex":"1","width":"100%","padding":"12px"},"children":[["$","div",null,{"className":"$undefined","style":{"display":"flex","gap":"0.4rem","flexWrap":"wrap","width":"100%"},"children":[false,[["$","a","A52F-5EF9",{"href":"/A52F-5EF9","className":"Post_fg__6on_n","style":{},"children":"Binary Search Tree"}]]]}],["$","article",null,{"className":"article","children":[["$","div",null,{"className":"$undefined","style":{"display":"flex","justifyContent":"space-between","flexWrap":"wrap","width":"100%"},"children":[["$","h2",null,{"style":{"margin":"0.2rem"},"children":["$","a",null,{"href":"/A52F-949C","children":"『Self-Adjusting Binary Search Trees』"}]}],["$","div",null,{"className":"$undefined","style":{"display":"flex","justifyContent":"end","alignItems":"center","flex":"1","textAlign":"right","whiteSpace":"nowrap"},"children":["$","div",null,{"children":"2024/11/1 5:13:00"}]}]]}],["$","div",null,{"className":"article_body","dangerouslySetInnerHTML":{"__html":"

https://www.cs.cmu.edu/~sleator/papers/self-adjusting.pdf\n

"}}]]}],["$","div",null,{"className":"$undefined","style":{"display":"flex","gap":"0.4rem","flexWrap":"wrap","width":"100%"},"children":[["$","a","",{"href":"/","className":"Post_bg__ejIUb","style":{"opacity":0},"children":"あれ"}],[]]}]]}]