Lecture Data Structures: Lesson 13 provide students with knowledge about trace of insert; cost of search; binary search tree; the tree we built for searching for duplicate numbers was a binary search tree; traversing a binary tree; recursive call; local variables are allocated storage on the call stack; . |