[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fe-iAw_kLnD2mLsDlSjFK_uygwCUjELQbHI_U8pPSAB8":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2025-12-20 21:33:37",276238198,[8,9,10,11],"39","30","36","33",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},97,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","exam_167930291","2025计科专升本期末复习题","下面的无向图(undirected graph),其中数字代表各对应边的权重(weight),则其"最小生成树"(minimal spanning tree)上的总权重为( ). \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fea3baaa75782c85f79b96cb6f311319e.webp\">",[21,33,42,51,60,69,78,87,96,105],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2025-12-20 21:33:36",276238050,[26,27,28,29],"后序","混合序","前序","中序","下图中的二叉搜索树要用什么方法遍历,才会使节点值由小到大的顺序遍历? \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F5f71bff59f9bb1b5ec4dafc2cb0b5745.webp\">","v1",0,{"answer":34,"createTime":23,"id":35,"options":36,"question":41,"source":31,"type":32},[],276238051,[37,38,39,40],"队列","树","图","栈","用邻接表表示图进行广度优先遍历时,通常借助( )来实现算法",{"answer":43,"createTime":5,"id":44,"options":45,"question":50,"source":31,"type":32},[],276238053,[46,47,48,49],"abcfdeg","afegdcb","abdefcg","abcdefg","下图所示的有向图若采用深度优先遍历,则遍历次序为( ). \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fc5fd38207b7b7a74b0f555d7c1768e0e.webp\">",{"answer":52,"createTime":5,"id":53,"options":54,"question":59,"source":31,"type":32},[],276238055,[55,56,57,58],"中序遍历","层次遍历","先序遍历","后序遍历","深度优先遍历类似于二叉树的( )",{"answer":61,"createTime":5,"id":62,"options":63,"question":68,"source":31,"type":32},[],276238060,[64,65,66,67],"4","3","2","5","由3个结点可以构造出( )种不同的二叉树",{"answer":70,"createTime":23,"id":71,"options":72,"question":77,"source":31,"type":32},[],276238063,[73,74,75,76],"ëlog2nû+1","log2n+1","log2n-1","ëlog2nû","一棵具有 n个结点的完全二叉树的高度(深度)是( )",{"answer":79,"createTime":23,"id":80,"options":81,"question":86,"source":31,"type":32},[],276238067,[82,83,84,85],"其他均不对","-1,7,15,7,4,8,20,9","-1,4,7,8,20,15,7,9","-1,4,8,9,20,7,15,7","有一组数据(15,9,7,8,20,-1,7,4),用堆排序的筛选方法建立的初始堆为 ( )",{"answer":88,"createTime":5,"id":89,"options":90,"question":95,"source":31,"type":32},[],276238068,[91,92,93,94],"n(n+1)\u002F2","n-1","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2815196056c8a054360d9b1c86374fd5.webp\">","n(n-1)\u002F2","设无向简单图的顶点个数为n,则该图最多有( )条边",{"answer":97,"createTime":23,"id":98,"options":99,"question":104,"source":31,"type":32},[],276238075,[100,101,102,103],"4, 3, 2, 1","5, 4, 2, 2","4, 3, 3, 1","5, 4, 3, 2","一有向图(directed graph)的邻接矩阵如下图,其中矩阵值代表边(edge)的长度,∞表示无此边,例如:顶点A至顶点B的边长为5,顶点B至顶点A的边长为∞.则从顶点A到顶点B, C, D, E的最短路径距离分别为( ). \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F4f997c8a284aee12c5716116b9664107.webp\">",{"answer":106,"createTime":23,"id":107,"options":108,"question":113,"source":31,"type":32},[],276238078,[109,110,111,112],"10","11","11至1 025之间","10至1 024之间","一个具有1025个结点的二叉树的高h为( )"]