true and false:

1. N^1.5 is O(N log N).
2. 1.01^N is O(N¹⁰⁰⁰).
3. 1/N is O(log N).
4. log N is O(N).
5. N + N is O(N log N).
6. In a binary tree every node must have at least one child node. False
7. The Binary Search Tree is always a balanced tree. False
8. The number of leaf nodes and internal nodes in a binary tree can never be equal.
9. The Postorder traversal of a binary search tree (BST) outputs the key values in nonincreasing order.
10. In an expression tree, the operators could be at the leaf nodes.
11. The deletion of a key in a BST has a higher time complexity than key search.
12. A binary search tree (BST) has to be a complete binary tree.
13. If a node in a BST has two children, then its Inorder successor has no left child.
14. An array that is in sorted order is a Min-heap.
15. The array representation of a Min-heap is always sorted.
16. In a Btree, the lengths of the paths from the root to all leaf nodes may be different.
17. In a Btree, deletion of a key will never alter the height of the tree.
18. The complexity of key insertion in a B tree is higher than that of deletion.
19. In an AVL tree, the longest and the shortest paths (number of edges) from the root to a leaf do not differ by more than 1.
20. In an AVL tree, rotations may not maintain the Inorder ordering of keys.