摘要:
1. 数学归纳法Proof that a binary tree with n leaves has a height of at least log n高度为 n" role="presentation">nn 的二叉树,叶子结点不多于 2n" role="pres... 阅读全文
摘要:
简易安装opencv2:conda install --channel https://conda.anaconda.org/menpo opencv或:sudo apt-get install libopencv-dev python-opencv简易安装openc... 阅读全文
摘要:
1. 二叉树普通定义:在计算机科学中,二叉树是每个结点最多有两个子树(≤2" role="presentation">≤2≤2,节点没有子树,节点有一个子树,节点有两个子树)的树结构。通常子树被称作“左子树”(left subtree)和“右子树”(ri... 阅读全文