"Data Structure" study notes Chapter 7 binary search tree

1, binary search trees Overview

• 

  • For reference Sorted Vector is particularly critical;

  • Balanced binary search tree (BBST) best embodies its powerful features!

• Definition: node with the key, and all nodes have to meet the "left child node smaller than the parent, the parent node is greater than the right child," the binary tree.

• nature:
  • If the left subtree of any node is not empty, then the value of the left sub-tree, all the nodes are less than the value of the root;
  • Right subtree of any node is not empty, then the right sub-tree, all the nodes which are greater than the value of the root;
  • Any node of the left and right subtrees are also binary search tree;
  • There is no equivalent key node.

"To be more"