What is the difference between order and degree in B tree?

Related questions

1. Why do we use AVL tree?
2. What is almost complete binary tree with example?
3. Is a single node a full binary tree?
4. What is height and depth of a tree?
5. Is heap a complete binary tree?
6. What is heap and stack?
7. Are all heaps binary?
8. How do you find the depth of a node in a binary tree?
9. How many leaf nodes does a tree have?
10. What is rank in BST?

Tags

1. #contain
2. #exactly
3. #words
4. #order
5. #therefore
6. #contains
7. #children
8. #whereas
9. #bound
10. #denotes
11. #upper
12. #lower
13. #degree
14. #values
15. #other
16. #maximal
17. #number