Introduction to Python Programming and Data Structures, 3rd Edition by Pearson

CHAPTER 19

Binary Search Trees

 

Objectives

• To understand the basics of a binary search tree (BST) (§19.2).
• To represent binary trees using linked data structures (§19.3).
• To search an element in a binary search tree (§19.4).
• To insert an element into a binary search tree (§19.5).
• To traverse elements in a binary tree (§19.6).
• To design and implement the BST class (§19.7).
• To delete elements from a binary search tree (§19.8).
• To display a binary tree graphically (§19.9).
• To implement Huffman coding for compressing data using a binary tree (§19.10).

19.1 Introduction

Key Point

A binary search tree is more efficient than a list for search, ...