C#擷取二叉樹深度及分層遍曆二叉樹

嘗試了一下用C#寫了一下二叉樹的相關演算法：

 

代碼

        #region 擷取二叉樹深度
        static int z, d = 0;    //z用於記錄遍曆到某節點時的深度，d用於記錄最大深度
        static int GetTreeDep(TreeNode node)
        {
            z++;
            if (d < z)
                d = z;
            if (node.leftNode != null)
            {
                GetTreeDep(node.leftNode);
                z--;
            }
            if (node.rightNode != null)
            {
                GetTreeDep(node.rightNode);
                z--;
            }
            return d;
        }
        #endregion

        #region 分層遍曆二叉樹
         static ArrayList al = new ArrayList();
        static ArrayList RecursiveTreeByLevel(TreeNode node)
        {
            k++;
            if (al.Count < k)
            {
                al.Add(node.nodeName);
            }
            else
            {
                al[k - 1] += node.nodeName;
            }

            if (node.leftNode != null)
            {
                RecursiveTreeByLevel(node.leftNode);
                k--;
            }
            if (node.rightNode != null)
            {
                RecursiveTreeByLevel(node.rightNode);
                k--;
            }
            return al;
        }
        #endregion