树3——搜索(中序)

【原理】

中左右

【实现】

    public class CRBTree
    {
        //前序：中->左->右
        public void PreOrder()
        {
            if (null != this.m_oRootTreeNode)
            {
                Console.Write(this.m_oRootTreeNode.ToString() + ";");

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

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

    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();
            }
        }
    }