May 2017
Intermediate to advanced
310 pages
8h 5m
English
Content preview from Python Data Structures and Algorithms
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
Binary search tree operations
There are essentially two operations that are needful for having a usable BST. These are the insert and remove operations. These operations must occur with the one rule that they must maintain the principle that gives the BST its structure.
Before we tackle the insertion and removal of nodes, let's discuss some equally important operations that will help us better understand the insert and remove operations.