1. ► Search in an unbalanced tree always has O(lg(n)) complexity
2. ► Tree traversal is a linear operation
3. ► In a post-order traversal, root nodes comes at the last
4. ► Node values in a binary search tree are ordered
5. ► Insert and delete in self-balancing trees happen in linear time
6. ► All binary search trees are balanced
7. ► STL has no tree container
8. ► Which of the traversals in binary search tree gives sorted list
9. ► In a tree, all nodes are connected
10. ► No node in a binary tree has more than 2 children
11. ► Insertion is O(n) operation in a tree
12. ► Leaf nodes have no children