trees and external storage in this introduction to trees java code for tree trees and red-black trees in binary treeeach node has one data item and can have up to two children if we allow more data items and children per nodethe result is multiway tree treesto which we devote the first part of this are multiway trees that can have up to four children and three data items per node trees are interesting for several reasons firstthey're balanced trees like red-black trees they're slightly less efficient than red-black trees but easier to program secondand most importantthey serve as an easy-to-understand introduction to -trees -tree is another kind of multiway tree that' particularly useful for organizing data in external storage (external means external to main memoryusually this is disk drivea node in -tree can have dozens or hundreds of children we'll discuss external storage and -trees at the end of this introduction to trees in this section we'll look at the characteristics of trees later we'll see how workshop applet models - tree and how we can program tree in java we'll also look at the surprisingly close relationship between trees and red-black trees figure shows small tree each lozenge-shaped node can hold onetwoor three data items efficiency of trees - trees external storage