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
10.1 AVL TREES
During the discussion on binary search trees (BST) in Chapter 7, it was appreciated that BST is an excellent
tool for fast search operations. It was also highlighted that if the data input to BST is not properly planned,
then there is every likelihood that the BST may end up in a skewed binary tree or at least a lopsided binary
tree wherein one subtree has more height than the other subtree. Consider the data given below:
Cat Family 5 {Lion, Tiger, Puma, Cheetah, Jaguar, Leopard, Cat, Panther, Cougar, Lynx, Ocelot}
This data can be provided in any combination and the resultant BSTs would be different from each
other depending u ...
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