Given a tree, you are supposed to tell if it is a complete binary tree.
Input Specification:
Each input file contains one test case. For each case,[……]
标签：dfs
1119. Pre- and Post-order Traversals (30)-PAT甲级真题（前序后序转中序）
Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and ino[……]
PAT 1127. ZigZagging on a Tree (30)-甲级
Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and ino[……]
1106. Lowest Price in Supply Chain (25)-PAT甲级真题(dfs,bfs,树的遍历)
A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）– everyone involved in moving a product from supplier to customer.[……]
1111. Online Map (30)-PAT甲级真题（Dijkstra + DFS）
Input our current position and a destination, an online map can recommend several paths. Now your job is to recommend two paths to your user: one is t[……]
PAT1115 Counting Nodes in a BST (30)-PAT甲级真题（二叉树的遍历，dfs）
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:
- The left subtree of a node contains only node[……]
PAT 1131. Subway Map (30) -甲级（图的遍历，DFS）
In the big cities, the subway systems always look so complex to the visitors. To give you some sense, the following figure shows the map of Beijing su[……]
PAT1130（DFS）
Given a syntax tree (binary), you are supposed to output the corresponding infix expression, with parentheses reflecting the precedences of the operat[……]
方格分割 2017-4
6×6的方格，沿着格子的边线剪开成两部分。
要求这两部分的形状完全相同。
如图：p1.png, p2.png, p3.png 就是可行的分割法。
试计算：
包括这3种分法在内，一共有多少种不同的分割方法。
注意：旋转对称的属于同一种分割法。
请提交该整数，不要填写任何多余的内容或说明文[……]
迷宫 2017-1
dfs常用递归+回溯
X星球的一处迷宫游乐场建在某个小山坡上。
它是由10×10相互连通的小房间组成的。
房间的地板上写着一个很大的字母。
我们假设玩家是面朝上坡的方向站立，则：
L表示走到左边的房间，
R表示走到右边的房间，
U表示走到上坡方向的房间，
D表示走到下坡方向的房间。
X星球的居[……]