binary trees in this why use binary treestree terminology an analogy in this we switch from algorithmsthe focus of "advanced sorting,to data structures binary trees are one of the fundamental data storage structures used in programming they provide advantages that the data structures we've seen so far cannot in this we'll learn why you would want to use treeshow they workand how to go about creating them how do binary search trees workfinding node inserting node traversing the tree finding maximum and why use binary treeswhy might you want to use treeusuallybecause it combines the advantages of two other structuresan ordered array and linked list you can search tree quicklyas you can an ordered arrayand you can also insert and delete items quicklyas you can with linked list let' explore these topics bit before delving into the details of trees minimum values deleting node the efficiency of binary trees trees represented as arrays duplicate keys the complete tree java program slow insertion in an ordered array imagine an array in which all the elements are arranged in order--that isan ordered arraysuch as we saw in "arrays as we learnedyou can quickly search such an array for particular valueusing binary search you check in the center of the arrayif the object you're looking for is greater than what you find thereyou narrow your search to the top half of the arrayif it' lessyou narrow your search to the bottom half applying this process repeatedly finds the object in (logntime you can also quickly iterate through an ordered arrayvisiting each object in sorted order on the other handif you want to insert new object into an ordered arrayyou first need to find where the object will goand then move all the objects with greater keys up the huffman code