1. ► Insertion is O(n) operation in a tree

2. ► In a post-order traversal, root nodes comes at the last

3. ► All binary search trees are balanced

4. ► Leaf nodes have no children

5. ► No node in a binary tree has more than 2 children

6. ► STL has no tree container

7. ► Tree traversal is a linear operation

8. ► Which of the traversals in binary search tree gives sorted list

9. ► Insert and delete in self-balancing trees happen in linear time

10. ► Search in an unbalanced tree always has O(lg(n)) complexity

11. ► In a tree, all nodes are connected

12. ► Node values in a binary search tree are ordered