树4——搜索(后序)

【原理】

左右中

【实现】

    public class CBSTree
    {
        //后序：左->右->中
        public void PostOrder()
        {
            if (null != this.m_oRootTreeNode)
            {
                if (null != this.m_oRootTreeNode.LeftTreeNode)
                {
                    this.m_oRootTreeNode.LeftTreeNode._PostOrder();
                }

                if (null != this.m_oRootTreeNode.RightTreeNode)
                {
                    this.m_oRootTreeNode.RightTreeNode._PostOrder();
                }

                Console.Write(this.m_oRootTreeNode.ToString() + ";");
            }
        }
    }
    
    public class CTreeNode
    {
        internal void _PreOrder()
        {
            Console.Write(this.ToString() + ";");

            if (null != this.m_oLeftTreeNode)
            {
                this.m_oLeftTreeNode._PreOrder();
            }

            if (null != this.m_oRightTreeNode)
            {
                this.m_oRightTreeNode._PreOrder();
            }
        }
    }