The operations that can be performed on a binary search tree are insert, delete, finding min, finding max, searching, and so on. We will discuss them in subsequent subsections.
Binary search tree operations
by Benjamin Baka, Dr. Basant Agarwal
Hands-On Data Structures and Algorithms with Python
- Title Page
- Copyright and Credits
- Dedication
- Packt Upsell
- Contributors
- Acknowledgments
- Preface
- Python Objects, Types, and Expressions
- Python Data Types and Structures
- Technical requirements
- Built-in data types
- None type
- Numeric types
- Representation error
- Membership, identity, and logical operations
- Sequences
- Learning about tuples
- Beginning with dictionaries
- Sorting dictionaries
- Dictionaries for text analysis
- Sets
- Modules for data structures and algorithms
- Summary
- Principles of Algorithm Design
- Lists and Pointer Structures
- Stacks and Queues
- Trees
- Hashing and Symbol Tables
- Graphs and Other Algorithms
- Searching
- Sorting
- Selection Algorithms
- String Algorithms and Techniques
- Design Techniques and Strategies
- Implementations, Applications, and Tools
- Other Books You May Enjoy
Binary search tree operations
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.