In the following data structures, () is a non-linear data structure

in the following data structures, () is a non-linear data structure

A: Tree (binary tree)
B: String
C: Queue
D: Stack
E: Linear table
F: two-dimensional array
G: Multidimensional arrays
H: Heap

The logical structure of data is divided into linear structure and nonlinear structure.
Common Linear Structures are: linear tables, stacks, queues, double queues, arrays, strings.
Common Nonlinear Structures are: two-dimensional arrays, multidimensional arrays, generalized tables, trees (binary trees, etc.), graphs, heaps.

a heap is a nonlinear structure.
From the data structure level, the heap is a special kind of tree data structure, a binary tree, with the largest heap minimum heap each node has a value. Usually what we call a heap of data structures is a two fork heap. There is a value for each node with the maximum heap minimum heap. Heap is divided into large piles, small Gan, Dagen is the root node of the tree is larger than the leaf node.