数据结构树高度_树数据结构的高度

数据结构树高度

In this tutorial, we’ll be discussing Binary Trees. We’ll see how to calculate the height of a tree data structure recursively as well as iteratively.

在本教程中，我们将讨论二叉树。 我们将看到如何递归和迭代地计算树数据结构的高度。

二叉树 (Binary Trees)

Binary Trees are a data structure in which data is stored in a hierarchical manner rather than linear (as it is done in LinkedList and Arrays).

二叉树是一种数据结构，其中的数据是以分层方式而不是线性方式存储的（就像在LinkedList和Arrays中一样）。

A Binary tree data structure consists of nodes. Each node holds the data along with the reference to the child pointers (left and right).

二叉树数据结构由节点组成。 每个节点都保存数据以及对子指针（左和右）的引用。

The root of the binary tree is the topmost node. (So opposite of an actual living tree).

二叉树的根是最顶层的节点。 （与实际的活树相反）。

Following is an illustration of a tree with some nodes.

以下是带有某些节点的树的图示。

The height of a node is the length of the longest