data structure and algorithms

answer true or false:

true

false

true

false

true

false

true

false

true

false

true

false

In the postorder traversal of any binary tree, the root is always visited last. Binary search trees are efficient because they guarantee (Ign) access time. Every subtree of a BST is another BST. In Binary Search Tree there is two paths from the root to every other node The degree of a tree is the same as the degree of its root node. A tree is full if and only if all of its leaves are at the same level