Questions

1. Can you give an example where you can use a binary search tree?
2. Which method is used to search for an element in a binary search tree?
3. Which techniques are used to adjust the balance in an AVL tree?
4. What is a symbol table?

5. Which class and method are called to generate a binary marshaled hash on the hash class?
6. Which container in Go is used to model a circular linked list?
7. How do you create a JSON (indented) from a tree structure? Which class and method are used?
8. How do you compare the sum of hashes?
9. What is the balance factor in an AVL tree?
10. How do you identify a row and column in a table?