January 2023
Intermediate to advanced
368 pages
7h 56m
English
Content preview from A Textbook of Data Structures and Algorithms, Volume 3
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,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Summary of Volume 2
- Preface
- Acknowledgments
- Chapter 8. Trees and Binary Trees
- 8.1. Introduction
- 8.2. Trees: definition and basic terminologies
- 8.2.1. Definition of trees
- 8.2.2. Basic terminologies of trees
- 8.3. Representation of trees
- 8.4. Binary trees: basic terminologies and types
- 8.4.1. Basic terminologies
- 8.4.2. Types of binary trees
- 8.5. Representation of binary trees
- 8.5.1. Array representation of binary trees
- 8.5.2. Linked representation of binary trees
- 8.6. Binary tree traversals
- 8.6.1. Inorder traversal
- 8.6.2. Postorder traversal
- 8.6.3. Preorder traversal
- 8.7. Threaded binary trees
- 8.7.1. Linked representation of a threaded binary tree
- 8.7.2. Growing threaded binary trees
- 8.8. Applications
- 8.8.1. Expression trees
- 8.8.2. Traversals of an expression tree
- 8.8.3. Conversion of infix expression to postfix expression
- 8.8.4. Segment trees
- 8.9. Illustrative problems
- Chapter 9. Graphs
- 9.1. Introduction
- 9.2. Definitions and basic terminologies
- 9.3. Representations of graphs
- 9.3.1. Sequential representation of graphs
- 9.3.2. Linked representation of graphs
- 9.4. Graph traversals
- 9.4.1. Breadth first traversal
- 9.4.2. Depth first traversal
- 9.5. Applications
- 9.5.1. Single source shortest path problem
- 9.5.2. Minimum cost spanning trees
- 9.6. Illustrative problems
- Chapter 10. Binary Search Trees and AVL Trees
- 10.1. Introduction
- 10.2. Binary search trees: definition and operations
- 10.2.1. Definition
- 10.2.2. Representation of a binary search tree
- 10.2.3. Retrieval ...
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.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.