July 2010
Intermediate to advanced
576 pages
11h 57m
English
Chapter 9 discussed about trees and binary trees. Binary search trees and AVL trees which belong to the category of binary trees provide retrievals in an efficient manner. This chapter elaborates operations on binary search trees along with the definition. Listing the drawbacks of binary search trees, AVL trees which provide the remedy, are defined. Operations on AVL trees are explained. This chapter also includes applications and implementation of both the trees.
A binary search tree (BST) is a binary tree. An empty binary tree is a binary search tree. A non-empty binary search tree should satisfy the following properties.
Read now
Unlock full access