Skip to Main Content
Data Structures using C, 2nd Edition
book

Data Structures using C, 2nd Edition

by A. K. Sharma
June 2013
Intermediate to advanced content levelIntermediate to advanced
516 pages
11h 21m
English
Pearson India
Content preview from Data Structures using C, 2nd Edition

10 Chapter

Advanced Data Structures

CHAPTER OUTLINE
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 ...

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

Introduction to Data Structures in C

Introduction to Data Structures in C

Ashok Kamthane
Data Structures Using C

Data Structures Using C

Samir Kumar Bandyopadhyay, Kashi Nath Dey

Publisher Resources

ISBN: 9789332524248