Search icon CANCEL
Subscription
0
Cart icon
Cart
Close icon
You have no products in your basket yet
Save more on your purchases!
Savings automatically calculated. No voucher code required
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletters
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Python Data Structures and Algorithms

You're reading from  Python Data Structures and Algorithms

Product type Book
Published in May 2017
Publisher Packt
ISBN-13 9781786467355
Pages 310 pages
Edition 1st Edition
Languages
Author (1):
Benjamin Baka Benjamin Baka
Profile icon Benjamin Baka
Toc

Table of Contents (20) Chapters close

Title Page
Credits
About the Author
About the Reviewer
www.PacktPub.com
Customer Feedback
Preface
1. Python Objects, Types, and Expressions 2. Python Data Types and Structures 3. Principles of Algorithm Design 4. Lists and Pointer Structures 5. Stacks and Queues 6. Trees 7. Hashing and Symbol Tables 8. Graphs and Other Algorithms 9. Searching 10. Sorting 11. Selection Algorithms 12. Design Techniques and Strategies 13. Implementations, Applications, and Tools

Binary trees


A binary tree is one in which each node has a maximum of two children. Binary trees are very common and we shall use them to build up a BST implementation in Python.

The following figure is an example of a binary tree with 5 being the root node:

Each child is identified as being the right or left child of its parent. Since the parent node is also a node by itself, each node will hold a reference to a right and left node even if the nodes do not exist.

A regular binary tree has no rules as to how elements are arranged in the tree. It only satisfies the condition that each node should have a maximum of two children.

Binary search trees

A binary search tree (BST) is a special kind of a binary tree. That is, it is a tree that is structurally a binary tree. Functionally, it is a tree that stores its nodes in such a way to be able to search through the tree efficiently.

There is a structure to a BST. For a given node with a value, all the nodes in the left sub-tree are less than or equal...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $15.99/month. Cancel anytime