using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace ConsoleApplication4
{
class Program
{
static void Main(string[] args)
{
Node node1 = new Node();
node1.data = 1;
Node node2 = new Node();
node2.data = 2;
Node node3 = new Node();
node3.data = 3;
Node node4 = new Node();
node4.data = 4;
Node node5 = new Node();
node5.data = 5;
Node node6 = new Node();
node6.data = 6;
node1.left = node2;
node1.right = node3;
node2.left = node4;
node2.right = node5;
node5.right = node6;
int depth=Program.findTreeLenght(node1);
}
public class Node
{
public int data = 0;
public Node left=null;
public Node right=null;
}
public static int findTreeLenght(Node head)
{
if (head == null)
{
return 0;
}
else
{
int rightLen = findTreeLenght(head.right);
int leftLen = findTreeLenght(head.left);
if(rightLen>leftLen)
{
return ++rightLen;
}
else
{
return ++leftLen;
}
}
}
}
}
得到二叉树的深度
最新推荐文章于 2021-09-26 22:45:01 发布