Skip to Main Content
Python Programming: A modular approach
book

Python Programming: A modular approach

by Kumar Naveen, Taneja Sheetal
January 2017
Intermediate to advanced content levelIntermediate to advanced
606 pages
14h 1m
English
Pearson Education India
Content preview from Python Programming: A modular approach

CHAPTER 15

DATA STRUCTURES III: BINARY SEARCH TRESS

CHAPTER OUTLINE

15.1 Definitions and Notations

15.2 Binary Search Tree

15.3 Traversal of Binary Search Trees

15.4 Building Binary Search Tree

In the previous chapters, we discussed linear data structures stacks, queues, and linked lists. However, there are situations that necessitate the use of the non-linear arrangement of data; for example, a directory is a hierarchical structure like a tree. In this chapter, we will briefly talk about trees and move on to study in detail binary search trees—a particular form of trees, used for efficiency in searching.

15.1 DEFINITIONS AND NOTATIONS

A tree is a hierarchical structure. It is a collection of elements called nodes along with a relation called ...

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,
and much more.
Start your free trial

You might also like

Modular Programming with Python

Modular Programming with Python

Erik Westra
Python Programming Blueprints

Python Programming Blueprints

Daniel Furtado, Marcus Pennington

Publisher Resources

ISBN: 9789352866038