二叉树 广度优先遍历

  1. /**
  2. * 广度优先遍历
  3. * **/
  4. public void BreadthFirstTreeWalk(BSTreeNode<T> root, Action<BSTreeNode<T>> func) {
  5. 	if (root == null) {
  6. 		return;
  7. 	}
  9. 	List<BSTreeNode<T>> processQueue = new List<BSTreeNode<T>>();
  10. 	processQueue.Add(root);
  11. 	BSTreeNode<T> current;
  13. 	while (processQueue.Count != 0) {
  14. 		current = processQueue[0];
  15. 		processQueue.RemoveAt(0);
  17. 		func(current);
  19. 		if (current.left != null) {
  20. 			processQueue.Add(current.left);
  21. 		}
  22. 		if (current.right != null) {
  23. 			processQueue.Add(current.right);
  24. 		}
  25. 	}
  26. 	return;
  27. }





【推广】 免费学中医，健康全家人
原文地址：https://www.cnblogs.com/xiejunzhao/p/62d014c2f33887907af88f97ebccbe6b.html