【基础知识】 binary search tree
2017-08-18 10:22
253 查看
binary search tree
见Binary Search Tree主要特点:小值在左,大值在右
最大值:树的最右节点。
最小值:树的最左节点。
某元素前驱:左子树的最右。
某元素的后继:右子树的最左。
相关文章推荐
- 【基础知识】 之 Binary Search Tree 二叉搜索树
- 数据结构基础---Binary Search Tree
- 【数据结构与算法基础】二叉查找树 / Binary Search Tree
- Leetcode:Recover Binary Search Tree
- BST(Binary Search Tree,二叉查找树,二叉排序树)c的实现(部分函数不知如何调用)
- LintCode: Convert Sorted Array to Binary Search Tree With Minimal Height
- leetcode-109-Convert Sorted List to Binary Search Tree
- Lintcode - Remove Node in Binary Search Tree
- leetcode[109]Convert Sorted List to Binary Search Tree
- 【LeetCode】Convert Sorted List to Binary Search Tree 解题报告
- ConvertBinarySearchTree
- **[Lintcode]Validate Binary Search Tree 验证二叉查找树
- LeetCode 98. Validate Binary Search Tree
- leetCode 96:Unique Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- LeetCode 109:Convert Sorted List to Binary Search Tree
- leetcode 66: Convert Sorted List to Binary Search Tree
- Convert sorted list into binary search tree
- LeetCode——Convert Sorted List to Binary Search Tree
- [leetcode] 235. Lowest Common Ancestor of a Binary Search Tree 解题报告