Lecture 11.
Binary search trees are binary trees with
an associated key value organized so that an inorder traversal yields the keys
in order.
Today we saw formal
definitions for binary trees and binary search trees. I went over algorithms for
searching, inserting and deleting. These algorithms were illustrated on a
running example and presented in high level
pseudo-code.
I returned marked
quiz #1 today.
Posted: Wed - January 31, 2007 at 10:45 AM