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
Trees 287
Consider the binary tree given in Figure 7.10.
Fig. 7.10 A full binary tree
No of
Nodes
Level
0 1
1 2
2 4
3 8
(1) The maximum number of nodes at level 0 5 1
The maximum number of nodes at level 1 5 2
The maximum number of nodes at level 2 5 4
The maximum number of nodes at level 3 5 8
By induction, it can be deduced that maximum nodes in a binary tree at level I = 2
I
(2) The maximum number of nodes possible in a binary tree of depth 0 5 1
The maximum number of nodes possible in a binary tree of depth 1 5 3
The maximum number of nodes possible in a binary tree of depth 2 5 7
The maximum number of nodes possible in ...
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