Skip to Main Content
Data Structures Using C, 2nd Edition by Pearson
book

Data Structures Using C, 2nd Edition by Pearson

by A. K. Sharma
May 2024
Intermediate to advanced content levelIntermediate to advanced
521 pages
14h 12m
English
Pearson India
Content preview from Data Structures Using C, 2nd Edition by Pearson
7.1 INTRODUCTION
There are situations where the nature of data is specific and cannot be represented by linear or sequen-
tial data structures. For example, as shown in Figure 7.1 hierarchical data such as ‘types of computers’ is
non-linear by nature.
Chapter
7
7.1 Introduction
7.2 Basic Terminology
7.3 Binary Trees
7.4 Representation of a Binary Tree
7.5 Types of Binary Trees
7.6 Weighted Binary Trees and Huffman Algorithm
7.7 Dynamic Dictionary Coding
CHAPTER OUTLINE
Fig. 7.1 Hierarchical data
Computers
Digital
Analog
Hybrid
Micro
Main
Super
Desk
top
Note
book
Situations such as roles performed by an entity, options available
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

Data Structures Using C

Data Structures Using C

Samir Kumar Bandyopadhyay, Kashi Nath Dey
Intermediate C Programming, 2nd Edition

Intermediate C Programming, 2nd Edition

Yung-Hsiang Lu, George K. Thiruvathukal

Publisher Resources

ISBN: 9781299831582