UVA 112 POJ 1145 Tree Summing(数据结构，二叉树，栈)

本文主要是介绍UVA 112 POJ 1145 Tree Summing(数据结构，二叉树，栈)，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=104&page=show_problem&problem=48

http://poj.org/problem?id=1145

Tree Summing

Background

LISP was one of the earliest high-level programming languages and, with FORTRAN, is one of the oldest languages currently being used. Lists, which are the fundamental data structures in LISP, can easily be adapted to represent other important data structures such as trees.

This problem deals with determining whether binary trees represented as LISP S-expressions possess a certain property.

The Problem

Given a binary tree of integers, you are to write a p

这篇关于UVA 112 POJ 1145 Tree Summing(数据结构，二叉树，栈)的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---