# What do you mean by depth of tree?

**What do you mean by depth of tree?**In

**byebyebimari**

The **depth** of a node is the number of edges from the node to the **tree’s** root node. A root node **will** have a **depth** of 0. The height of a node is the number of edges on the longest path from the node to a leaf. A leaf node **will** have a height of 0.

.

Likewise, what is the depth of tree in data structure?

The **depth** of a node is the number of edges in the path from the root node to that node. The **depth** of a binary **tree** is usually used to refer to the height of the **tree**. The height of node 2 is 1 because from 2 there is a path to two leaf nodes (4 and 5), and each of the two paths is only 1 edge long, so the largest is 1.

Secondly, how do you measure the height and depth of a tree? So in case of **tree height**, it is measured from Leaf Node to Internal Node, in upward direction. And in case of **depth**, it is measured from Root Node to Internal Node in downward direction.

Also to know is, what is the depth of a node in a tree?

The **depth of a node** is the number of edges from the root to the **node**. The height of a **node** is the number of edges from the **node** to the deepest leaf. The height of a **tree** is a height of the root. A full binary **tree**.is a binary **tree** in which each **node** has exactly zero or two children.

What is a height of a tree?

**Height** of **tree** –The **height of a tree** is the number of edges on the longest downward path between the root and a leaf. So the **height of a tree** is the **height** of its root.

**Trending Answer**

**ByeByeBimari**

**ByeByeBimari**

**ByeByeBimari**