The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one of important research topics in coding theory. Recently, Li (IEEE Trans. Inf. Theory, 67(1): 124-129, 2021) and Li and Li (Discrete Math., 345: 112718, 2022) obtained the complete weight hierarchy of linear codes from quadratic forms over finite fields of odd characteristic by analysis of the solutions of the restricted quadratic equation in its subspace. In this talk, we further determine the complete weight hierarchy of linear codes from quadratic forms over finite fields of even characteristic by carefully studying the behavior of the corresponding restricted quadratic forms to the subspaces of the field, and complement the results of Li and Li. In addition, we investigate the generalized Hamming weights of a class of linear code $\C$ over $\bF_q$, which is constructed from defining sets. These defining sets are either special simplicial complexes or their complements in $\bF_q^m$. We determine the complete weight hierarchies of these codes. This talk is based on a joint work with Dabin Zheng and Xiaoqiang Wang.