条件:一颗普通的二叉树,给定二叉树的两个节点,nodeA、nodeB
输出:找到nodeA和nodeB的最短路径,并输出:如的d节点到h节点的最短路径为红线所示:
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace ConsoleApplication2
{
class Program
{
static void Main(string[] args)
{
#region 构造一棵已知的二叉树
//* A
//* B C
//* D E F
Node<string>[] binTree = new Node<string>[8];
//创建结点
binTree[0] = new Node<string>("A");
binTree[1] = new Node<string>("B")