Data structure :

1/ True or false :

1- If x is a descendant of y, and x is a descendant of z, then y is a descendant of z ( )

2- In the inorder traversal of any binary tree, the root is never visited last. ( )

3- A node is a leaf if and only if it has degree 0. ( )

4- In the inorder traversal of any binary tree, the node that is farthest from the root is always visited last. ( )

5- A tree is full if and only if all of its leaves are at the same level. ( )

6- The degree of a tree is the same as the degree of its root node. ( )

7- The number of leaves in a binary tree cannot be less than its height. ( )

8- The height of a tree is the length of its longest root-to-leaf path. ( )

9- The number of leaves in a full binary tree of height h is 2h. ( )

10 -Every subtree of a complete binary tree is complete. ( )