Menu
According to Wikipedia,
The height of a tree is the length of the path from the root to the deepest node in the tree. A (rooted) tree with only one node (the root) has a height of zero (or one).
I dont get it - is it zero or one (or both)?
420
Root-tree: a tree with only one node. Binary tree: a tree in which each node has at most two children (parent, left, and right) Two tree: a binary tree that either is empty or each non-leaf has two children. Heap: a tree where parent node has bigger (smaller) value than children.
The depth of a node is the number of edges from that node to the tree's root node. As such, the depth of the whole tree would be the depth of its deepest leaf node. The root node has a depth of 0.
It just an assuption you make for the recursive description of the height of a binary tree. You can consider a tree composed by just a node either with 0 height or with 1 height.
If you really want to think about it somehow you can think that
This is just to describe how much height the smallest tree has, then in any case whenever you add a descending node you will add also a related edge so it will increase accordingly.
In the example provided in wikipedia:
This tree can have height 4 (nodes) or 3 (edges). It depends if you are counting it by edges or by nodes.
183
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
