![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构与算法
医学影像处理
从计算机角度记录学习医学影像分割与检测、影像组学、脑磁图/脑电信号数据处理的笔记
展开
-
1.Index Mapping (or Trivial Hashing) with negatives allowed[数据结构]
Given a limited range array contains both positive and non positive numbers, i.e., elements are in range from -MAX to +MAX. Our task is to search for some number is present in the array of not in O(1)原创 2017-11-29 15:00:34 · 405 阅读 · 0 评论 -
2.Binary Heap[数据结构]
A Binary Heap is a Binary Tree with following properties. 1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible).原创 2017-11-30 22:52:28 · 682 阅读 · 0 评论 -
3.Tree Traversals (Inorder, Preorder and Postorder)[数据结构]
Inorder Traversal:Algorithm Inorder(tree) 1. Traverse the left subtree, i.e., call Inorder(left-subtree) 2. Visit the root. 3. Traverse the right subtree, i.e., call Inorder(right-subtree)原创 2017-12-01 15:22:01 · 1269 阅读 · 0 评论