algorithm - Balancing a ternary search tree -
how 1 go 'balancing' ternary search tree? tst implementations don't address balancing, suggest inserting in optimal order (which can't control.)
the article in dr. dobbs ternary search trees says: d.d. sleator , r.e. tarjan describe theoretical balancing algorithms ternary search trees in "self-adjusting binary search trees" (journal of acm, july 1985). can find online versions of paper favorite search engine.
Comments
Post a Comment