What is a Binary Search Tree (BST)? What is the difference between BST, AVL tree, and B-tree?

What is a Binary Search Tree (BST)? What is the difference between BST, AVL tree, and B-tree?

题目类型: 技术面试题

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

难度: medium

标签: interviewbit, computer-science, topic-specific, cs-fundamentals

参考答案摘要

A Binary Search Tree (BST) is a binary tree where, for every node: Left subtree contains values smaller than the node. Right subtree contains values greater than the node. Average time complexity for ...

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