binary trees finding node in binary search tree involves going from node to nodeasking how big the node' key is in relation to the search key how big the node' key is compared to its right or left children what leaf node we want to reach what level we are on an unbalanced tree is one in which most of the keys have values greater than the average whose behavior is unpredictable in which the root or some other node has many more left children than right childrenor vice versa that is shaped like an umbrella inserting node starts with the same steps as node suppose node has successor node then must have key that is larger than but smaller than or equal to in binary tree used to represent mathematical expressionwhich of the following is not truea both children of an operator node must be operands following postorder traversalno parentheses need to be added following an inorder traversalparentheses must be added in pre-order traversal node is visited before either of its children if tree is represented by an arraythe right child of node at index has an index of true or falsedeleting node with one child from binary search tree involves finding that node' successor huffman tree is typically used to text which of the following is not true about huffman treea the most frequently used characters always appear near the top of the tree normallydecoding message involves repeatedly following path from the root to leaf