- Binary Tree : It is a tree data structure in which each node has at most two children. As such there is no relation between a parent and its left and right descendants. Hence they are unordered.
-
Binary Search Tree : These are ordered binary trees with a recursive relation left<root<right which is followed at every node. Its due to this rule that helps in faster search,insertion and deletion. The best case is achieved when the tree is balanced.
Note: Not all BSTs are self balancing.
-
B-Tree : It
is a generalization of a BST in that a node can have more than two
children. These are self balancing and hence the average and worst
complexities is logarithmic.We opt for these when the data is too huge
to fit in main memory. These structures are used in database indexing
and help in faster operations on disk. -
B+ Tree : In
these copies of the keys are stored in the internal nodes; the keys and
records are stored in leaves; in addition, a leaf node may include a
pointer to the next leaf node to speed sequential access. These are used
in File systems, DBMS etc.
相关文章
- 11-0230 Day Challenge Day 7 | Leetcode 235. Lowest Common Ancestor of a Binary Search Tree
- 11-027-235. Lowest Common Ancestor of a Binary Search Tree
- 11-02letecode [235] - Lowest Common Ancestor of a Binary Search Tree
- 11-02Python3解leetcode Lowest Common Ancestor of a Binary Search TreeBinary Tree Paths
- 11-02235. Lowest Common Ancestor of a Binary Search Tree (E)
- 11-02leetcode [701. 二叉搜索树中的插入操作](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/)
- 11-0285. Insert Node in a Binary Search Tree【easy】
- 11-02Convert Sorted Array to Binary Search Tree
- 11-021382. Balance a Binary Search Tree
- 11-02【LeetCode】109. Convert Sorted List to Binary Search Tree 解题报告（Python）