[Career Cup 4][subjects from 18~24] Chapter 4 Trees and Graphs
2011-09-16 16:55
405 查看
Trees and Graphs
Subjects from 18~24
18 如何判断一棵树是平衡的
19 在一个有向图中判断在两个节点之间是否存在可达路径?
20 给定一个已升序排序数组,创建一棵二叉树
21 将一棵二叉搜索树,将其转化为一个链表
22 假定一棵二叉搜索树中,每个结点都有一个parent指针,写一个算法找到某个节点的下一个节点(中序遍历下的直接后继)
23 找到一棵二叉树中,两个节点的共同最近祖先
24 判断树T2是否是T1的子树,其中T1有数百万个节点,T2有数百个节点
Subjects from 18~24
18 如何判断一棵树是平衡的
19 在一个有向图中判断在两个节点之间是否存在可达路径?
20 给定一个已升序排序数组,创建一棵二叉树
21 将一棵二叉搜索树,将其转化为一个链表
22 假定一棵二叉搜索树中,每个结点都有一个parent指针,写一个算法找到某个节点的下一个节点(中序遍历下的直接后继)
23 找到一棵二叉树中,两个节点的共同最近祖先
24 判断树T2是否是T1的子树,其中T1有数百万个节点,T2有数百个节点
相关文章推荐
- [Career Cup 11][subjects from 57~59] Chapter 18 Thread and locks
- [Career Cup 3][subjects from 14~17] Chapter 3 Stacks and Queues
- [Career Cup 6][subjects from 31~35] Chapter 9 Sorting and Searching
- Chapter 4 | Trees and Graphs--判断有向图两节点之间是否存在路径
- CareerCup Chapter 4 Trees and Graphs
- [Career Cup 7][subjects from 36~41] Chapter 12 System design and Memory Limits
- [Career Cup 1][subjects from 1~8] Chapter 1 Arrays and Strings
- Chapter 4 | Trees and Graphs--有序数组构建最小高度的二叉树
- Chapter 4 | Trees and Graphs--有序数组构建最小高度的二叉树
- Chapter 4 | Trees and Graphs--检查一棵树是否平衡以及判断一棵树是否为平衡二叉树
- 【CareerCup】Trees and Graphs—Q4.2
- Chapter 4 Trees and Graphs - 4.1
- Chapter 4 Trees and Graphs - 4.2
- Chapter 18. Tools for Cloud Infrastructure V (Debugging, Logging, and Monitoring for Containerized A
- 【CareerCup】Trees and Graphs—Q4.3
- sql server: Graphs, Trees, Hierarchies and Recursive Queries
- Chapter 18 Attributes and Reflection
- [Career Cup 5][subjects from 25~30] Chapter 5 Bit Manipulation
- Chapter 4 Trees and Graphs - 4.3
- Chp4: Trees and Graphs