nodes with duplicate key values may cause trouble in arrays because only the first one can be found in search trees can be represented in the computer' memory as an arrayalthough the reference-based approach is more common huffman tree is binary tree (but not search treeused in data-compression algorithm called huffman coding in the huffman code the characters that appear most frequently are coded with the fewest bitsand those that appear rarely are coded with the most bits questions these questions are intended as self-test for readers answers may be found in appendix insertion and deletion in tree require what big time binary tree is search tree if every non-leaf node has children whose key values are less than (or equal tothe parent every left child has key less than the parent and every right child has key greater than (or equal tothe parent in the path from the root to every leaf nodethe key of each node is greater than (or equal tothe key of its parent node can have maximum of two children true or falsenot all trees are binary trees in complete binary tree with nodesand the root considered to be at level how many nodes are there at level subtree of binary tree always has root that is child of the main tree' root root unconnected to the main tree' root fewer nodes than the main tree sibling with the same number of nodes in the java code for treethe and the are generally separate classes