各种树的概念小总结

Binary tree: Empty or node with links to left and right binary trees.

Complete tree: Perfectly balanced, except for bottom level.

Binary heap: Array representation of a heap-ordered complete binary tree.

Binary Search Tree: A BST is a binary tree in symmetric order.

Symmetric order.(Search Tree) Each node has a key, and every node’s key is: 1. Larger than all keys in its left subtree. 2. Smaller than all keys in its right subtree.

Balanced Search Tree: red-black tree, 2-3 tree