c语言求二叉树高度_C / C ++中二叉树的高度

c语言求二叉树高度

The height of a Binary Tree is defined as the maximum depth of any leaf node from the root node. That is, it is the length of the longest path from the root node to any leaf node.

二叉树的高度定义为任何叶节点距根节点的最大深度。 也就是说，它是从根节点到任何叶节点的最长路径的长度。

Let us consider the below Binary Tree.

让我们考虑下面的二叉树。

Binary Tree Ht

二叉树Ht

Since the leaf nodes corresponding to the maximum depth are 40 and 50, to find the height, we simply find the number of edges from the root node to either one of these two nodes, which is 3.

由于对应于最大深度的叶节点是40和50 ，为了找到高度，我们只需找到从根节点到这两个节点之一的边数，即3。

Now that we know what the height of a Binary tree signifies, we sha