6_10 下落的树叶（UVa699）<二叉树的DFS>

【6_10 下落的树叶（UVa699）<二叉树的DFS>】的更多相关文章

6_10 下落的树叶（UVa699）<二叉树的DFS>

每年到了秋天树叶渐渐染上鲜艳的颜色,接着就会落到树下来.假如落叶发生在二叉树,那会形成多大的树叶堆呢?我们假设二叉树中的每个节点所落下的叶子的数目等于该节点所储存的值.我们也假设叶子都是垂直落到地面上(真感谢没有风把他们吹的到处都是).最后,我们再假设节点之间水平的距离是以下列方式定义:某个节点到其左子树以及到其右子树的水平距离均为1.以下图来说明: 含有5和含有6的节点位于同一水平位置(当然,他们垂直的位置不同).含有7的节点位于含有5的节点和含有6的节点左边一个位置.而含有3的节点则位于含有…

6-10 下落的树叶 uva699

类似第九题都是属于比较巧妙的题目 ! 用一个p数组来保存水平值然后开始built 自然就会按照自左而右的顺序来读取!!!!!!这很重要 #include<bits/stdc++.h> using namespace std; void built (int pos); ]={}; int main() { ; ) { memset(p,,sizeof(p)); p[]+=root; built(-);built(+); ; )t++; printf("Case %d:\n…

下落的树叶（The Falling Leaves UVA - 699）

题目描述: 原题:https://vjudge.net/problem/UVA-699 题目思路: 1.依旧二叉树的DFS 2.建树过程中开个数组统计 //紫书源代码WA AC代码: #include <iostream> #include <cstring> using namespace std; ; int sum[maxn] ; void buildtree(int val,int p) //建树,p为树根的水平位置 { int vl,vr; ) return ; sum[…

(二叉树递归 DFS) leetcode 100. Same Tree

Given two binary trees, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical and the nodes have the same value. Example 1: Input: 1 1 / \ / \ 2 3 2 3 [1,2,3], [1,2,3] Outpu…

(二叉树 BFS DFS) leetcode 104. Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Note: A leaf is a node with no children. Example: Given binary tree [3,9,20,null,null,15,7…

(二叉树 BFS DFS) leetcode 111. Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. Note: A leaf is a node with no children. Example: Given binary tree [3,9,20,null,null,15,7…