binary trees why use binary trees slow insertion in an ordered array slow searching in linked list trees to the rescue what is tree tree terminology path root parent child leaf subtree visiting traversing levels keys binary trees an analogy how do binary search trees work the binary tree workshop applet representing the tree in java code finding node using the workshop applet to find node java code for finding node tree efficiency inserting node using the workshop applet to insert node java code for inserting node traversing the tree inorder traversal java code for traversing traversing three-node tree traversing with the workshop applet preorder and postorder traversals finding maximum and minimum values deleting node case the node to be deleted has no children case the node to be deleted has one child case the node to be deleted has two children xi