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