Binary tree (5)----Finding the number of binary tree nodes, recursive and non-recursive

1. Binary Tree definition

typedef struct BTREENODEELEMENT_T_ {    void *data;} btreenodeelement_t;typedef struct Btreenode_t_ {    btreenodeelement_t *m_pelemt;    struct Btreenode_t_    *m_pleft;    struct btreenode_t_    *m_pright;} btreenode_t;

2. Find binary tree node points

The number of nodes for any given subtree, the number of left subtree nodes + right subtree nodes +1, plus 1 is the root node itself

(1) Recursive mode:

Returns 0 if the given root node is null;

Returns if the given root node is not null: number of left dial hand tree nodes + right subtree node +1

int Getbtreenodestotal (btreenode_t *proot) {    if (proot = = NULL)        return 0;    Return (Getbtreenodestotal (proot->m_pleft) + getbtreenodestotal (proot->m_pright) + 1);}

(2) Non-recursive mode:

Any kind of traversal method: Pre-order, post-order, middle sequence, by layer traversal mode can be

Pre-order, post-order, middle-sequence, by-layer traversal.

Binary tree (5)----Finding the number of binary tree nodes, recursive and non-recursive