Lecture Algorithms and data structures: Chapter 19 - Algorithm Analysis
Lecture Algorithms and data structures: Chapter 19 - Algorithm Analysis
A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. This chapter introduce perfect binary trees: Definitions and examples, number of nodes, logarithmic height, number of leaf nodes, applications.