answersLogoWhite

0

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

User Avatar

Wiki User

14y ago

What else can I help you with?

Related Questions

How to define the word lush?

A heavy or habitual or daily or regular. Example: there was a lush green tree.


Count the number of nodes of a binary tree having depth n?

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.


Define the term tree line?

Tree forest


What is the size of the tree with depth 3?

7 its a binary tree


How will you define totapari?

a coniferous tree


How do you find dept of binary tree?

0 for an empty tree 1 for a leaf otherwise depth (t) = 1 + max (depth (t->left), depth (t->right))


If a binary tree it have 18 nodes what is the minimum depth of the tree?

3


Is there a useless tree?

This depends on how you define "usless"


What is the difference between height and depth of a tree?

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.....


Difference between height of a tree and depth of a tree and level of a tree?

The height of a tree is the longest path from the root to a leaf, counting the number of edges. The depth of a tree is the longest path from the root to a leaf, counting the number of nodes. The level of a tree refers to the depth of a node with respect to the root, where the root is considered to be at level 0.


Is there any bark less tree?

Nope. Bark is one of the things that define a tree.


Define tree in data structure?

Tree is directed, cycle-less, connected graph.