我們的注意焦點要轉到搜尋樹（search tree）了，要深度討論兩種標準的樹結構（tree structure），就是本章所要說明的二元搜尋樹（binary search tree）以及下一章所要討論的 AVL 平衡樹（AVL tree）。這兩種樹其資料都依序排列的，它們之間的差別只在於 AVL 是一種平衡樹，而二元搜尋樹卻不是。-We want to focus the attention of the search tree (search tree), and want to discuss the depth of the tree structure of two standard (tree structure), this chapter is to explain the binary search tree (binary search tree), as well as the next chapter to be discussed by the AVL balanced tree (AVL tree). Planting trees in these two data are arranged in order, the difference between them lies in a balanced AVL tree, binary search tree which are not.