Just a quick note... what you said about bounding the size of a binary tree (or the suffix tree) to at most m-1 is true for a *complete* binary tree, but in general, it could be m (e.g. a root node with one child). Just a minor detail. Great videos!!! 🙂
This is pure gold. Great explanation
Thank you !
This is really well explained. It appeals to intuition really well. Thank you!
Just a quick note... what you said about bounding the size of a binary tree (or the suffix tree) to at most m-1 is true for a *complete* binary tree, but in general, it could be m (e.g. a root node with one child). Just a minor detail.
Great videos!!! 🙂