When a binary search tree is balanced, it provides O(logN) search, addition, and removal. True False A depth-first traversal of a tree is also known as a level-order traversal. True False When a binary search tree is balanced, it provides O(N2) search, addition, and removal. True False The number of nodes in a non-empty tree is equal to the number of nodes in its left subtree plus the number of nodes in its right subtree plus 1 O True False