C# 二叉树GetEnumerator()方法实现非递归中序遍历

本文深入探讨了抽象节点类和树类的实现细节,通过使用泛型,展示了如何构建灵活且高效的树结构。重点阐述了节点的属性设置、树的遍历方法以及如何利用栈来实现迭代式中序遍历。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

using System;

using System.Collections.Generic;

using System.Collections;

namespace MyPractise.TreePractise

{

/// <summary>

/// Abstract node

/// </summary>

/// <typeparam name="T">Node instance</typeparam>

abstract class TreeNode<T> where T : TreeNode<T>

{

public T LeftNode { get; set; }

public T RightNode { get; set; }

}

/// <summary>

/// Tree class

/// </summary>

/// <typeparam name="T">Node instance</typeparam>

class Tree<T> where T : TreeNode<T>

{

/// <summary>

/// Root node

/// </summary>

public T RootNode { get; set; }

public IEnumerator GetEnumerator()

{

//Reserve nodes which have right node.

Stack<T> stack = new Stack<T>();

//Current node instance

T currentNode = RootNode;

//When current node was set as the last node's right node, exit the cycle

while(currentNode!=null)

{

//When current still has left node, add current node to stack and set current node as the his left node, do the cycle again

while (currentNode.LeftNode != null)

{

stack.Push(currentNode);

currentNode = currentNode.LeftNode;

}

//Add current node to stack

stack.Push(currentNode);

//Set current node as the output of the stack, output the node

do

{

if (stack.Count != 0)

{

currentNode = (T)stack.Pop();

yield return currentNode;

}

else

{

break;

}

}

//Do this cycle, until right node of current node was not empty

while (currentNode.RightNode == null);

//Set current node as the right node and go on the big cycle

currentNode = currentNode.RightNode;

}

}

}

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值