1064. Complete Binary Search Tree (30) PAT甲级
2017-02-10 20:21
417 查看
传送门
#include<stdio.h> #include<algorithm> using namespace std; #define MAX_N 1100 int n; int CBSTree[MAX_N]; int in[MAX_N]; int co=1; void inOrder(int root){ if(root>n) return; inOrder(root*2); CBSTree[root]=in[co++]; inOrder(root*2+1); } int main(){ scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%d",&in[i]); } sort(in+1,in+1+n); inOrder(1); for(int i=1;i<=n;i++){ printf("%d",CBSTree[i]); if(i!=n) printf(" "); } }
相关文章推荐
- PAT甲级 1064. Complete Binary Search Tree (30)
- PAT甲级.1064. Complete Binary Search Tree (30)
- PAT 甲级 1064. Complete Binary Search Tree (30)
- pat 甲级 1064. Complete Binary Search Tree (30)
- PAT甲级-1064. Complete Binary Search Tree (30)
- PAT - 甲级 - 1064. Complete Binary Search Tree (30)(完全二叉搜索树层次遍历)
- PAT甲级1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)【二叉树】——PAT (Advanced Level) Practise
- PAT(A) - 1064. Complete Binary Search Tree (30)
- PAT (Advanced Level) Practise 1064 Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)-PAT
- PAT题库-1064. Complete Binary Search Tree (30)
- PAT (Advanced Level) 1064. Complete Binary Search Tree (30) 递归建立CBST
- PAT 1064. Complete Binary Search Tree (30)
- PAT-A 1064. Complete Binary Search Tree (30)
- pat-a1064. Complete Binary Search Tree (30)
- PAT 1064. Complete Binary Search Tree (30) 快速建立完全二叉树
- 1064. Complete Binary Search Tree (30)【二叉树】——PAT (Advanced Level) Practise
- PAT甲题题解-1064. Complete Binary Search Tree (30)-中序和层次遍历,水
- pat 1064. Complete Binary Search Tree (30)