给你一些介绍数据结构的链表,栈,队列,树,二叉树,以及图的特点和描述的英文吧,自己删除一些,写个大概：

　　let'sgetacquaintedwithsomeofthemostcommondatastructures.

　　//链表

　　Linked_List:Theformaldefinitionis"adatastructureconsistingofagroupofnodeswhichtogetherrepresentasequence."Likearrays,linkedlistshaveindexes,butareaccessedbyiterators.Inthelinkedlistbelow,theheadis"12",whichiswheretheiteratoralwaysbegins.Supposewehavealinkedlistobjectcalled"list",thenlist.head=12andlist.head.next=99.Thelastnodeiscalledthetailandisalways"null"(nothingthere).

　　//栈

　　stack:Firstcome,firstserved

　　//队列

　　Queue:TheQueuedatastructureprovidesfirstcome,firstserved

　　//树

　　Tree:Ifyou'veeverlookedatagenealogytable,oratthechainofcommandinacorporation,you'veseendataarrangedinatree.Atreeiscomposedofacollectionofnodes,whereeachnodehassomeassociateddataandasetofchildren.Anode'schildrenarethosenodesthatappearimmediatelybeneaththenodeitself.Anode'sparentisthenodeimmediatelyaboveit.Atree'srootisthesinglenodethatcontainsnoparent.

　　//二叉树

　　Binarytree:Abinarytreeisaspecialkindoftree,onethatlimitseachnodetonomorethantwochildren.Abinarysearchtree,orBST,isabinarytreewhosenodesarearrangedsuchthatforeverynoden,allofthenodesinn'sleftsubtreehaveavaluelessthann,andallnodesinn'srightsubtreehaveavaluegreaterthann.Aswediscussed,intheaveragecaseBSTsofferlog2nasymptotictimeforinserts,deletes,andsearches.

　　//图

　　Graphs:Graphsarecomposedofasetofnodesandedges,justliketrees,butwithgraphstherearenorulesfortheconnectionsbetweennodes.Withgraphsthereisnoconceptofarootnode,noristhereaconceptofparentsandchildren.Rather,agraphisjustacollectionofinterconnectednodes.