Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

On trees - how could we neglect the Succinct trees?

Succinctness - expressing trees with as little bits as entropically possible. The representation is as simple as it could be - simply write down nested parentheses whose abstract syntax tree is your given tree. Practically all tree operations in logarithmic or constant time. How it works - recursively with range-min trees and range-max trees - simple and elegant number theory.

A primer - https://arxiv.org/pdf/0905.0768



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: