build bst time complexity

1. preface /***** This article will try to explain something about:* -- Bubble sort.* -- Quick sort.* -- Merge sort.* -- Heap sort.* To read this, some prerequisites is necessary:* -- A keep ve skill in C programming language.* -- A basic skill in CPP.* -- Basic knowledge about Time complexity and Space complexity.* -- A generous mind for my fault because this ar

child of the precursor node is empty, set its right child to the current node. The current node is updated to the left child of the current node. b) If the right child of the precursor node is the current node, reset its right child to null. The reverse output is from the left child of the current node to all nodes on this path of the precursor node .The current node is updated to the right child of the current node. 3. Repeat the above 1, 2 until the current node is empty.Analysis of Complex

evenly, the worst case of space complexity O (n), The case of degradation to bubble sort is the average Time complex O (nlog2 N), the worst time to reach O (n²) Heap Sort:is not adjacent to the exchange, so the unstable sort does not need the auxiliary array, the space complexity of O (1) to

requires more memory space than the heap, because it requires an extra array.3. Heap sequencing (heapsort)Heap sequencing is suitable for situations where data volumes are very large (millions of data).Heap ordering does not require a large number of recursive or multidimensional staging arrays. This is appropriate for a very large sequence of data volumes. For example, more than millions of records, because the fast sort, the merge sort all uses the recursive design algorithm, when the data vo

high, high priority is the same low-priority high. Base sorting is based on sorting separately and is collected separately, so it is a stable sorting algorithm.(7) Hill Sort (shell)Hill sort is the insertion of elements according to different steps, when the first element is very disordered, the step is the largest, so the number of elements inserted in the order is very small, fast; when the elements are basically ordered, the step size is very low, and the insertion sort is very efficient for

The basic idea of heap sorting: to sort by establishing the maximum minimum heap according to a complete binary treeComplexity of Time: O (NLONGN)/** * */Package com;/** * @author Wenb * @time pm 03:52:55 * @date 2014-10-24*/ Public classHeapsort { Public Static voidMain (String args[]) {int[] A = {1,3,2, +,5, A,98, Wu}; Headsort (a); for(intI=0; i) {System. out. Print (a[i]+" "); } }

Choosing sort, quick sort, hill sort, heap sort is not a stable sorting algorithm, bubble sort, insert sort, merge sort, and Cardinal sort are stable sorting algorithms.Bubbling method:This is the most primitive, and well-known, slowest algorithm. The origin of his name is because its work looks like bubbling: The complexity is O (n*n). When the data is in the positive order, there will be no exchange. The complex