Skip to Main Content
Programming and Data Structures
book

Programming and Data Structures

by Ashok Kamthane
August 2009
Intermediate to advanced content levelIntermediate to advanced
604 pages
21h 39m
English
Pearson India
Content preview from Programming and Data Structures
CHAPTER OUTLINE
15.1 Trees
15.2 Binary Trees
15.3 Types of Binary Tree
15.4 Binary T ree Representation
15.5 T raversing Binary T rees
15.6
Binary SearchTree
15.7
Insertion and Deletion Operations
15.8
HashingTechnology
Exercises
15.1 TREES
A tree is a predetermined non-empty set of items in which one element is called the root and the
remaining items are divided into n>=0 disjoint subsets, each of which can be a tree itself. Every item in
the tree is called a node. Every node in a tree can act as a root and can have zero or more branches
(subtrees). Fig. 15.1 shows the tree.
Fig. 15.1 Sample trees
15.2 BINARY TREES
A linked list is an efficient data s
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

Learning Data Structures and Algorithms

Learning Data Structures and Algorithms

Rod Stephens
Data Structures and Algorithms in C++, Second Edition

Data Structures and Algorithms in C++, Second Edition

Michael T. Goodrich, Roberto Tamassia, David M. Mount

Publisher Resources

ISBN: 9789332506343