标签:chain 存储 ice roo tree root dfs rom heap
树 | 备注 |
1004 Counting Leaves | |
1020 Tree Traversals | |
1043 Is It a Binary Search Tree | 判断BST,BST的性质 |
1053 Path of Equal Weight | |
1064 Complete Binary Search Tree | 完全二叉树的顺序存储,BST的性质 |
1066 Root of AVL Tree | 构建AVL树,模板题,需理解记忆 |
1079 Total Sales of Supply Chain | |
1086 Tree Traversals Again | |
1090 Highest Price in Supply Chain | |
1094 The Largest Generation | |
1099 Build A Binary Search Tree | 与1064类似,BST的性质 |
1102 Invert a Binary Tree | |
1106 Lowest Price in Supply Chain | |
1110 Complete Binary Tree | 判断给定的树是否为完全二叉树 |
1115 Counting Nodes in a BST | |
1119 Pre- and Post-order Traversals | 由前序序列和后序序列构建二叉树(***) |
1123 Is It a Complete AVL Tree | AVL和CBT,结合了1066和1110 |
1127 ZigZagging on a Tree | |
1130 Infix Expression | |
1135 Is It A Red-Black Tree | 深刻理解红黑树的性质,dfs(***) |
1143 Lowest Common Ancestor | 求BST的LCA,求普通BiTree的LCA呢?(***) |
1147 Heaps | 堆的性质,完全二叉树的顺序存储(***) |
数学问题 | |
1023 Have Fun with Numbers | 大整数乘法 |
1024 Palindromic Number | 大整数加法,判断回文数 |
1136 A Delayed Palindrome | 大整数加法,判断回文数(和1024一模一样!) |
1065 A+B and C (64bit) | long long int判断溢出,边界条件 |
1104 Sum of Number Segments | 找规律,细节 |
1088 Rational Arithmetic | 分数的四则远算,模板 |
1059 Prime Factors | 获取素数,质因子分解(***) |
标签:chain 存储 ice roo tree root dfs rom heap
原文地址:https://www.cnblogs.com/kkmjy/p/9523968.html