Lecture Data Structures: Lesson 12 provide students with knowledge about operations on binary tree; applications of binary trees; searching for duplicates; C++ implementation; trace of insert; a linked list could handle the growth but the comparisons would still be large; . |