What is the advantage of a ternary search tree over trie?

What is the advantage of a ternary search tree over trie?

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, nutanix, company-specific

目标公司: Nutanix

参考答案摘要

In contrast to the trie(standard) data structure, which has 26 pointers for its offspring, every node in a ternary search tree only has three: The left pointer is pointing to the node whose value is l...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。