data structures algorithms in javasecond edition the efficiency of binary trees trees represented as arrays duplicate keys the complete tree java program the huffman code character codes decoding with the huffman tree creating the huffman tree coding the message creating the huffman code summary questions experiments programming projects red-black trees our approach to the discussion conceptual top-down insertion balanced and unbalanced trees degenerates to ( balance to the rescue red-black tree characteristics fixing rule violations using the rbtree workshop applet clicking on node the start button the ins button the del button the flip button the rol button the ror button the / button text messages where' the find button experimenting with the workshop applet experiment inserting two red nodes experiment rotations experiment color flips