定義及相關背景知識

Background

表示法

Representation

二元搜尋樹

Binary Search Tree (BST)

手動建立一顆二元搜尋樹

Manually construct a binary search tree.

二元搜尋樹-走訪

binary search tree- Visiting.

二元搜尋樹-搜尋: 在二元搜尋樹中搜尋value=x的node,若搜尋到輸出x,未找到輸出 None

Binary search tree- search: Search for the node with value x in the binary search tree. If found, output x; “None” if not found.

二元搜尋樹-插入

binary search tree- Insertion.

利用插入方法建立二元搜尋樹

Creating a Binary Search Tree Using Insertion Method

一些平衡樹介紹

Introduction to Balanced Trees