售 价：¥
9.8
温馨提示：数字商品不支持退换货，不提供源文件，不支持导出打印
为你推荐
To the Reader
Binary Trees
Introduction to binary trees
Mathematical properties of binary trees
Traversals of binary trees
Introduction to traversals of binary trees
Inorder traversal
Level-order traversal
Binary Search Trees
Symmetric order of items
Adding items to the binary search tree in accordance with symmetric order
Searching for an item in a binary search tree
Symmetric order of items and traversals of the binary search tree
Binary search trees and quicksort partitioning
Addition of items to the binary search tree and searching for a particular item – properties
Defining the data structure
Subtree counts
Addition of items to the binary search tree – Java implementation
Searching in the binary search tree – Java code
The smallest and the greatest items in the binary search tree
Recursive implementations of binary (search) tree traversals
Inorder traversal of the binary search tree – non-recursive Java implementation
Implementation of the binary search tree level-order traversal
Rank() and select() implementations
Rank() and select() operations – properties
Floor(), ceiling()
Deletion of the smallest and the greatest items
Deletion of an arbitrary item in the binary search tree
Hibbard-deletion – Java implementation
Asymmetry in Hibbard-deletion of items
Range queries
Binary search trees and geometric search
Orthogonal line segment intersections
2D orthogonal range search
2d-trees
Nearest neighbor search in a 2d-tree
Range search in a 2d tree
Interval search trees
Orthogonal rectangle intersection
Check Yourself
Check Yourself - Answers
买过这本书的人还买过
读了这本书的人还在读
同类图书排行榜
购物车
个人中心
