Binary tree

4.2 Classification trees 4.2.1 Terminology 4.2.4 reesExercise (a) How many leaves does a complete binary tree of depthd contain? (Nb. a complete tree is one where all its nodes are -balanced.) (b) Show, for a tree T with offspring per internal node, that Answer 26/200 25 /200 Chapter 4. Decision Trees 4.2 Classification trees 4.2,1 Terminology Example 4.2.2: Classifying the kyphosis data