go top

Cartesian tree

  • 笛卡尔树

网络释义英英释义

  笛卡尔树

RMQ转LCA时需要用到笛卡尔树(Cartesian Tree),构造笛卡尔树时把数组中最小的数作为树根,其左右儿子分别为左右两边的子数组构成的笛卡尔树

基于2056个网页-相关网页

  笛卡儿树

笛卡儿树(Cartesian Tree) 是一种特殊的堆,它根据一个长度为n的数组A建立。它的根是A的最小元素位置i,而左子树和右子树分别为A[1.

基于12个网页-相关网页

短语

Cartesian Tree Sort 笛卡尔树排序

Cartesian tree

  • abstract: In computer science, a Cartesian tree is a binary tree derived from a sequence of numbers; it can be uniquely defined from the properties that it is heap-ordered and that a symmetric (in-order) traversal of the tree returns the original sequence. Introduced by in the context of geometric range searching data structures, Cartesian trees have also been used in the definition of the treap and randomized binary search tree data structures for binary search problems.

以上来源于: WordNet

双语例句

  • It maintains the free space in heap as nodes in a Cartesian binary search tree format.

    按照Cartesian二分法检索格式节点的形式维护中的空闲空间

    youdao

  • A new unstructured Cartesian cutted grid generation method is introduced. The grid generation of some airfoils and wing is performed with the tree data structure.

    描述了一种新的网格生成技术,即笛卡尔结构切割网格技术,采用叉数据结构完成几种单段多段翼型以及三维机翼网格生成。

    youdao

更多双语例句
$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定