3.1

1 C

2 C

int TreeNodes(BiTree T) // T T

ENGLISH JUST IN CASE

3.1 Write a recursive algorithm to count the number of nodes in a binary tree implemented as a binary chain table store, where each node has an integer number of data elements. Write a recursive algorithm to count the number of all nodes in this binary tree. (1) Define the data structure of this binary tree in C (2) Explain the idea of the algorithm and write a C implementation of the algorithm. Algorithm idea Algorithm implementation

int TreeNodes(BiTree T) // Explanation: The return value is the number of nodes in the binary tree T; T is the input tree parameter.

Need it ASAP. Thanks.