Implement recursive and non-Recursive Algorithms for Binary Tree depth

1. /** Binary Tree depth recursion algorithm */
2. Int depth (btree root)
3. {
4. Int ldepth, rdepth;
5. If (! Root) return 0;
6. Else {
7. Ldepth = depth (root-> lchild );
8. Rdepth = depth (root-> rchild );
10. Return ldepth> rdepth? Ldepth + 1; rdepth + 1;
11. }
12. }
14. /** Non-Recursive Algorithms for Binary Tree depth (modified based on the Root Traversal Algorithm)
16. Http://blog.csdn.net/panqiaomu/archive/2007/05/17/1612556.aspx */
18. Int depth1 (btree root ){
19. Int Top = 0;
20. Int depth = 0, temp = 0; // temp stores the maximum value of the current single branch
21. Btree P = root;
22. Btree nodepointer [max_tree_degree];
23. While (p | top> 0 ){
24. If (p ){
25. Nodepointer [Top] = P;
26. ++ Top;
27. ++ Depth; // count the depth of a single branch
28. P = p-> lchild;
29. } Else {
30. -- Top;
31. P = nodepointer [Top];
32. P = p-> rchild;
33. If (P = NULL) {// end of a single branch
34. If (depth> temp)
35. Temp = depth;
36. -- Depth;
37. }
38. } // Else
39. } // While
40. Return temp;
41. }