zoukankan      html  css  js  c++  java
  • 数据结构王道错题集2019版(上>一>四章)

    ------------------------------------------------------------------序言------------------------------------------------------------------------

     

    <<<<----------------------------------------------------------------------拉慢点------------------------------------------->>>>

    <<<<----------------------------------------------------------------------拉慢点------------------------------------------->>>>

    <<<<----------------------------------------------------------------------拉慢点------------------------------------------->>>>

    <<<<----------------------------------------------------------------------拉慢点------------------------------------------->>>>

    <<<<----------------------------------------------------------------------拉慢点------------------------------------------->>>>

    <<<<----------------------------------------------------------------------拉慢点------------------------------------------->>>>

    <<<<----------------------------------------------------------------------拉慢点------------------------------------------->>>>

    <<<<----------------------------------------------------------------------拉慢点------------------------------------------->>>>

     --------------------------------------------------复杂度-----------------------------------------------------------------------------------------

     

     -----------------------------------------------------线性表-------------------------------------------------------------------

     

     

    还是不会这个题怎么得出来的结果!!!!

    -----------------------------------------------------------栈和队列--------------------------------------------------------------

    我选D

    我选D

    我选A

     

    -----------------------------------------------------------队列-----------------------------------------------------------

     

     选B这样的话不就判断为满了吗?

     

     

     

    以为数组从1开始,采取带入数字的方式进行计算

    ---------------------------------------------------------------二叉树---------------------------------------------------------------

    ----------------------------------------------------------------二叉树节点运算--------------------------------------------------------------------

    想一下度数为1和度数为2节点之间的关系

    9,10我选的DD

    仔细思考,做错了两次,自己的答案是否真的是最优解!!!!!

     

    -----------------------------------------------------------------《二叉树遍历》------------------------------------------------------------------------

    !!!!!!!!!!二叉搜索树中没有存放节点双亲的线索,找不到其双亲

     

    -----------------------------------------------------------------《森林》---------------------------------------------------------------------------

    画图证明,这种题一本简单的画图一般都能解决。。。。。

    -----------------------------------------------------------------------《平衡树》---------------------------------------------------------- 

  • 相关阅读:
    贝塞尔曲线原理(转载)
    无法启动此程序,因为计算机中丢失api-ms-win-crt-runtime-|1-1-0.dll
    HDU 3530 Subsequence(单调队列)
    Gym 100247I Meteor Flow(优先队列)
    BZOJ 1040: [ZJOI2008]骑士(基环树dp)
    Gym 100247C Victor's Research(有多少区间之和为S)
    Gym 100247A The Power of the Dark Side
    Gym 100247B Similar Strings(哈希+思维)
    51nod 1405 树的距离之和(dfs)
    51nod 1378 夹克老爷的愤怒(树型dp+贪心)
  • 原文地址:https://www.cnblogs.com/0123wtdd/p/10855750.html
Copyright © 2011-2022 走看看