If the depth of an AVL tree with nodes { 1, 2, 3, 4 } is 3 (the
If the depth of an AVL tree with nodes { 1, 2, 3, 4 } is 3 (the depth of the root is 1), then either node 2 or node 3 must have two children. ~@[](2)答案:TRUE
-->