The number of levels in the tree is called the ''Depth'' of the Tree.
Example: O
/ \
O O levels of a tree showing Depth.
/ \ / \
O O O O
A heavy or habitual or daily or regular. Example: there was a lush green tree.
Use the following formula: (2^n)-1. E.g., if the depth is 3, the number of nodes is (2^3)-1 = 8-1 = 7. Note that 7 is the maximum number of nodes, not the actual number of nodes. To count the actual nodes you must traverse the tree, updating an accumulator as you go.
Tree forest
7 its a binary tree
0 for an empty tree 1 for a leaf otherwise depth (t) = 1 + max (depth (t->left), depth (t->right))
a coniferous tree
3
Level and height are same, but the depth is the is the maximum distance from any node to root. It is reverse in the case of height.
height and depth of a tree is equal... but height and depth of a node is not equal because... the height is calculated by traversing from leaf to the given node depth is calculated from traversal from root to the given node.....
This depends on how you define "usless"
define "greenest". what makes one tree greener?
我不知道-look it up