Along with these too:This is a list of data structures. For a wider list of terms, see list of terms relating to algorithms and data structures. For a comparison of running time of subset of this list see comparison of data structures.Data typesEditPrimitive typesBoolean, true or falseCharacterFloating-point, single-precision real number valuesDouble, a wider floating-point sizeInteger, integral or fixed-precision valuesEnumerated type, a small set of uniquely named valuesComposite types(Sometimes also referred to as Plain old data structures.)ArrayRecord (also called tuple or struct)UnionTagged union (also called a variant, variant record, discriminated union, or disjoint union)Abstract data typesArrayContainerMap/Associative array/DictionaryMultimapListSetMultisetPriority queueQueueDequeStackStringTreeGraphSome properties of abstract data types:Structure Stable Unique Cells per NodeBag (multiset) no no 1Set no yes 1List yes no 1Map no yes 2"Stable" means that input order is retained.Other structures such as "linked list" and "stack" cannot easily be defined this way because there are specific operations associated with them.Linear data structuresArraysArrayBidirectional mapBit arrayBit fieldBitboardBitmapCircular bufferControl tableImageDynamic arrayGap bufferHashed array treeHeightmapLookup tableMatrixParallel arraySorted arraySparse arraySparse matrixIliffe vectorVariable-length arrayListsDoubly linked listArray listLinked listSelf-organizing listSkip listUnrolled linked listVListXor linked listZipperDoubly connected edge listDifference listTreesEditTree (data structure)Binary treesAA treeAVL treeBinary search treeBinary treeCartesian treeOrder statistic treePagodaRandomized binary search treeRed-black treeRopeScapegoat treeSelf-balancing binary search treeSplay treeT-treeTango treeThreaded binary treeTop treeTreapWeight-balanced treeBinary data structureB-treesB-treeB+ treeB*-treeB sharp treeDancing tree2-3 tree2-3-4 treeQueapFusion treeBx-treeAListHeapsHeapBinary heapWeak heapBinomial heapFibonacci heapAF-heap2-3 heapSoft heapPairing heapLeftist heapTreapBeapSkew heapTernary heapD-ary heapBrodal queueTriesIn these data structures each tree node compares a bit slice of key values.TrieRadix treeSuffix treeSuffix arrayCompressed suffix arrayFM-indexGeneralised suffix treeB-trieJudy arrayX-fast trieY-fast trieCtrieMultiway treesTernary treeK-ary treeAndor tree(a,-treeLink/cut treeSPQR-treeSpaghetti stackDisjoint-set data structureFusion treeEnfiladeExponential treeFenwick treeVan Emde Boas treeRose treeSpace-partitioning treesThese are data structures used for space partitioning or binary space partitioning.Segment treeInterval treeRange treeBinKd-treeImplicit kd-treeMin/max kd-treeAdaptive k-d treeQuadtreeOctreeLinear octreeZ-orderUB-treeR-treeR+ treeR* treeHilbert R-treeX-treeMetric treeCover treeM-treeVP-treeBK-treeBounding interval hierarchyBSP treeRapidly exploring random treeApplication-specific treesAbstract syntax treeParse treeDecision treeAlternating decision treeMinimax treeExpectiminimax treeFinger treeExpression treeHashesEditBloom filterCount-Min sketchDistributed hash tableDouble HashingDynamic perfect hash tableHash array mapped trieHash listHash tableHash treeHash trieKoordePrefix hash treeRolling hashMinHashQuotient filterCtrieGraphsEditGraphAdjacency listAdjacency matrixGraph-structured stackScene graphBinary decision diagramZero-suppressed decision diagramAnd-inverter graphDirected graphDirected acyclic graphPropositional directed acyclic graphMultigraphHypergraphOtherEditLightmapWinged edgeDoubly connected edge listQuad-edgeRouting tableSymbol tableExternal linksEditConclusion:There is many ways to organize data. And I can see XML and JSON in... I would say all of them--concept wise--, in tree structure to csv.
