算法

```js function sortArray(nums) { randomizedQuicksort(nums, 0, nums.length - 1) return nums } functio

```js var Trie = function() { this.children = {}; }; Trie.prototype.insert = function(word) { let no

```js const tree ={ value: 1, left: { value: 2, left: { value: 4 }, right: { value: 5 }, }, right: {