举一反三
- 对于如下图所示的最大堆，删除掉最大的元素后，堆的后序遍历结果是For the following maximum heap, after deleting the maximum element, the post order traversal sequence is[img=387x212]1802faee53d86da.png[/img]
- 对于最大堆64,42,58,23,36,47,56,11,22,27,4,2;删除掉最大元素后，调整后堆中元素为: A: 56,42,58,23,36,47,2,11,22,27,4 B: 58,42,56,36,23,47,2,11,22,27,4 C: 58,42,56,23,36,47,11,2,22,27,4 D: 58,42,56,23,36,47,2,11,22,27,4
- 如下电路图所示，计算电路图中的Uab= V。[img src="https://file.icve.com.cn/ssykt/159/92/27D1703833BA6D34862056DFEE50AE69.png"]
- 如下图所示，请求出电路图中的等效电阻为 Ω。[img src="https://file.icve.com.cn/ssykt/215/475/35F76CD6D690F61EDBABDB92F29C4F9B.png"]
- If A is a matrix, the function of the function max(a(:)) is ( ). A: to work out the maximum element of the entire matrix B: function call errors C: to work out the maximum element of each row of the matrix D: to work out the maximum element of each column of the matrix
内容
- 0
下列哪些系统是线性系统？ 未知类型：{'options': ['[img src="https://cdn.nlark.com/yuque/__latex/e14c1b881198319f4b4716c2e578dd19.svg"]', '[img src="https://cdn.nlark.com/yuque/__latex/3ef517a51306b556507064fe8acaefc0.svg"]', '[img src="https://cdn.nlark.com/yuque/__latex/aad5666f58053cb6ebdee75357d4a031.svg"]', '[img src="https://cdn.nlark.com/yuque/__latex/6ea68f63cecae80ac4c0e24bf8db4943.svg"]'], 'type': 102}
- 1
If A is a matrix, the function max(A(:)) is ( ). A: to return the first element B: to return the maximum element in each row of the matrix C: to return the maximum element in each column of the matrix D: to return the largest element of the entire matrix
- 2
操作序列[插入7, 插入8, 插入9, 插入6, 插入11, 插入10,删除11]，将形成哪棵splay树？ 未知类型：{'options': ['[img src="https://i1.chinesemooc.org/course/formula/201610/1fe37d2235edd7bee892eb6239147cb7.png"]', '[img src="https://i1.chinesemooc.org/course/formula/201610/74cb10336eb9bfd230d32a99fef448f2.png"]', '[img src="https://i1.chinesemooc.org/course/formula/201610/db8d48a842f1098d34bc41887be146dc.png"]', '[img src="https://i1.chinesemooc.org/course/formula/201610/3297213d29850a1769f795d87e81a226.png"]'], 'type': 102}
- 3
How to use the heap to sort:如何用堆来实现排序： A: Continue to call delMax() after building a heap建堆后不断调用delMax() B: Continue to call getMax() after building a heap建堆后不断调用getMax() C: Continue to call insert() after building a heap建堆后不断调用insert() D: Build the heap建堆
- 4
遍历如下二叉树，先序遍历结果序列（），中序遍历结果序列（），后序遍历结果序列（）。[img=430x410]17e0c7eb0edddd8.png[/img]