Activity : Binary Tree | |||
Create a binary tree using the following keyfield data. A right child node indicates the condition 'comes later in the alphabet'. Shade the leaf nodes. Hunter, Billings, Charles, Preece, Alston, Nolan, Musgrove, Denton, Carlton When you have done this, check your answer by clicking on the box below.
|
|||
Back |