HackerTube 中文?

17. Succinct Structures I

MIT OpenCourseWareYouTube ↗

Further reading 1

Caption notes

Rank and select let a succinct tree encoding navigate between nodes. The space budget distinguishes the underlying bit vector from the extra index that makes queries fast.

Video or transcript source ↗
Original passages · 2
If I have rank and select in constant time, now I can do left child, right child, parent in constant time.
17. Succinct Structures I · ▶ 32:35–32:41
all I'm allowed for rank and select is little o of n space.
17. Succinct Structures I · ▶ 33:34–33:39

Hacker News comments

View original on HN ↗