True or False: 1. Two binary trees T and T' are said to be copies if both these trees have the same structure 2. For a B tree the root node has at least two children if it is not a terminal (leaf)...

True or False:

1. Two binary trees T and T' are said to be copies if both these trees have the same structure

2. For a B tree the root node has at least two children if it is not a terminal (leaf) node

3. A trie is very commonly used to store a dictionary

4. B-trees are often used to index the data and provide fast access