data structures in java examples

mapping of key-value pairs, the relationship belongs to the inner object in the collection, which has direct access to the elements in the collection. In practical applications I think more of the nesting of maps.The tool class (collections, Arrays) Collections Collection Tool class is an operation combined with a specialized tool class which is defined by a static method, A variety of sorting binary lookups for the list collection (analogy string operations) can also turn threads unsafe into t

Array Advantages: Fast query, if you know the index can quickly access the disadvantage: Delete slow, size fixed ordered array advantages: Faster than unordered array lookup disadvantage: Delete and insert slow, size fixed stack advantages: Provide last-in-first-out access method disadvantage: Access to other items is slow queue advantages: Provide first-in-out access method disadvantage: access to other The items are slow. List Advantages: Quick Insert, delete fast disadvantage: find slow (each

} + } - //complement the left and right sub-tree nodes of the two-fork tree the for(intj = 0; J ){ *Btn[j].setleftnode (btn[2*j + 1]); $Btn[j].setrightnode (Btn[2*j + 2]);Panax Notoginseng } - } the //Recursive method pre-order traversal + voidPreorder (Binarytreenode btn) { ABinarytreenode root =btn; the if(Root! =NULL){ + Printnode (root); - inorder (root.leftnode); $ inorder (root.rightnode); $ } - } - //recursi

Php Chinese network (www.php.cn) provides the most comprehensive basic tutorial on programming technology, introducing HTML, CSS, Javascript, Python, Java, Ruby, C, PHP, basic knowledge of MySQL and other programming languages. At the same time, this site also provides a large number of online instances, through which you can better learn programming... Reply: Programming languages are tools, such as hammers, axes, screwdrivers... The

: a container for data storage, an array, or a linked list; a pointer; Other API behaviors are all around the container ** The main composition of a queue: a container for data storage, an array of arrays, or a list of two pointers. ** is not suitable for large amounts of storage, just a means of implementing some sort of algorithm.,** Restricted access Mode **@ authorerjun2017 December 6 Morning 9:11:40*/

capacityincrement) Vector initial capacity is initialcapacity, increment is capacityincrement The smaller the vector increment set, the higher the utilization of the memory space, but the greater the number of memory allocations The larger the vector increment is set, the less memory allocation will be performed, but it is possible to generate memory waste Adding elements to a vector: the Add () method or the Insertelementat () method After inserting an element, the

methods of collection and traversal mode Collection:add () Remove () contains () iterator () size () Traversal: Enhanced for iterator |--listget () Traversal: normal For|--setmap:put () Remove () ContainsKey (), Containsvalue () KeySet () get () value () EntrySet () size () Traversal: Find values based on key values for key and value jobs: Any collection I've explained, I ask you to store what you are able to store. And, you have to be able to traverse it.4:arraylist,linkedlist,hashset,hashmap

//Delete a node in a binary sort tree the PublicBstree Deletebstree (Bstree bstree,intkey) { the if(Bstree = =NULL) { - return NULL; - } the the if(Bstree.data = =key) { the //first case: leaf node the if(Bstree.left = =NULL Bstree.right = =NULL) { -Bstree =NULL; the } the //second case: node has left dial hand nodes. the if(Bstree.left! =NULL Bstree.right = =NULL) {94Bstree =Bstree.left; t

1 PackageIYou.neugle.search;2 3 Public classHash_search {4 Private Static intm = 13;5 Private Static int[] hash =New int[m];6 Private Static int[] Array =New int[] {13, 25, 2, 60, 39, 52 };7 8 Public Static voidMain (string[] args) {9 Inserthash ();TenSYSTEM.OUT.PRINTLN ("Hash table is established as follows:"); OneSystem.out.print ("["); A for(inti = 0; i ) { - System.out.print (Hash[i]); - if(I! = hash.length-1) { theSystem.out.print (","); -

arraybub{[] (max) {=[max]= } (value) {[]=value++} () { (j=jBubblesort {(string[] args) {maxSize = Arraybub arr = Arraybub (maxSize) Arr.insert () Arr.insert () arr.inse RT () Arr.insert () Arr.insert () Arr.insert () Arr.insert () Arr.insert () Arr.insert () Arr.insert () Arr.insert () Arr.insert () Arr.insert () Arr.display () Arr.bubblesort () Arr.display ()} () {}}First look at the above code, bubble sort core is: Bubblesort () method, for loop nesting, the outer layer of each row minus one,

public class Myarraylist　　Self-made data structures (containers)-java development with the most ArrayList and HashMap

GCD Greatest Common divisorMethod: Euclid Algorithm (Euclidean method),"Thought" recursionIdeasCode1 Public classMain {2 Public Static intgcdintPintq) {3 if(q = 0) {4 returnp;5 }6 intr = p%Q;7 returngcd (q, R);8 }9}LCM Least common multipleThe pursuit of convenient formula method to solve.IdeasCode1 Public classMain {2 Public Static intgcdintPintq) {3 if(q = 0) {4 returnp;5 }6 intr = p%Q;7 ret

only inherit one parent classPolymorphicFour, algorithm effectiveness analysis:4.1 Time Complexity: Https://baike.baidu.com/item/%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6/1894057?fr=aladdin (Baidu Connection)　　F (N) =n! (factorial) n-times with a time complexity of n4.2 Space Complexity: Https://baike.baidu.com/item/%E7%A9%BA%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6/9664257?fr=aladdin (Baidu Connection)V. Abstract classTo include one or more abstract methods (without a method body): To implement

Stackelement see the implementation of the stackPackage Com.lip.datastruture.stack;public class QueueOperation Result:Implementation of the queue of data structures (JAVA)

' (', directly into the stack, if ') ', out of the stack and sequential output operator until the first ' (', the first encountered ' ('), but not the output, if the arithmetic character, the top element of the stack and the current element precedence: If the top of the stack operator precedence >= the current element priority , out of the stack and sequential output operator until the top element of the stack priority 5, repeat the 3rd until the expression scan is complete.6, sequentially out

public int getheight () {if (this==null) return 0;if (This.leftnode = = NULL This.rightnode = = null) retu RN 1;int lheight = This.leftNode.getHeight (); int rheight = This.rightNode.getHeight (); return lheight > Rheight? Lheight + 1:rheight + 1;}4. Layer k of the print tree (recursive implementation)Principle: Can be understood as the print root of the K-layer, that is, print the root of the child's k-1 layer, when k=0, can be directly printed outPrint the level layer of a tree public void P

()) { CharCH =Thestack.pop (); Output= output +ch; } returnoutput; } } classReverseapp { Public Static voidMain (string[] args)throwsIOException {String input, output; while(true) {System.out.print ("Enter A string:"); System.out.flush (); Input=getString1 (); if(Input.equals ("")) { Break; } reverser Thereverser=Newreverser (input); Output=Thereverser.dorev (); System.out.println ("Reversed:" +output); } } Public StaticString getString

initialization does not require allocating space, but it needs to allocate a pointer field, there is a structural overhead, but there is no length limit. Application recommendations:?? If the use of the stack element changes unpredictable, sometimes very small, sometimes very large, then it is best to use the chain stack, conversely, if its change in the controllable range, it is recommended to use a sequential stack is better.The reason for using the stack: the introduction of the stack s

This article summarizes some of the data structures implemented in JavaBriefly:ListQueuemapSetThe data structure involved:Stack: provides push and stack (POP) functionsqueues: non-blocking methods for offer and pull, blocking methods for put and takeList : provides various functions such as add, find, remove, traverse, etc.Tree: Red-black tree, usually used for r

more additions and deletions: LinkedList104 query MORE: ArrayList the I don't know, just use ArrayList.106 I don't know, just use ArrayList.107 108 3: Common methods of collection and Traverse mode 109 　　 Collection: the Add ()111 Remove () the contains ()113 iterator () the size () the the 　　　 Traversal:　117 Enhanced for118 iterators119 -|--List121 get ()122 123 Traversal:124 General for the|--Set126 127 　　 Map: - put ()129 Remove () the Con