const getURLParameters = url =>
(url.match(/([^?=&]+)(=([^&]*))/g) || []).reduce(
    (a, v) => (
      (a[v.slice(0, v.indexOf('='))] = v.slice(v.indexOf('=') + 1)), a
    ),
    {}
);

function printHeap(heap, index, level) {
    if (index >= heap.length) {
        return;
    }
    console.log("  ".repeat(level) + heap[index]);
    printHeap(heap, 2 * index + 1, level + 1);
    printHeap(heap, 2 * index + 2, level + 1);
}

//You can call this function by passing in the heap array and the index of the root node, which is typically 0, and level = 0.

let heap = [3, 8, 7, 15, 17, 30, 35, 2, 4, 5, 9];
printHeap(heap,0,0)

<div className="md:self-start sticky top-16 bg-background px-4 mt-1 sm:px-6 md:pt-4 lg:pl-8 lg:pr-4">
          <ScrollArea className="whitespace-nowrap">
            <div className="w-max flex md:flex-col gap-1 bg-transparent text-muted-foreground pb-2">
              {menuData.map((section) => (
                <Button
                  key={section.title}
                  onClick={() => handleScrollToSection(section.title)}
                  variant="ghost"
                  size="sm"
                  className={cn(
                    'w-auto md:w-full hover:cursor-pointer relative md:justify-end',
                    activeSection === section.title
                      ? cn(
                          'text-foreground after:absolute after:bottom-[-2px] after:bottom-0 after:w-full after:h-[2px] after:bg-primary',
                          'md:after:right-[-2px] md:after:top-0 md:after:h-full md:after:w-[2px]',
                        )
                      : '',
                  )}
                >
                  {section.title}
                </Button>
              ))}
            </div>
            <ScrollBar orientation="horizontal" />
          </ScrollArea>
        </div>

const permutations = arr => {
  if (arr.length <= 2) return arr.length === 2 ? [arr, [arr[1], arr[0]]] : arr;
  return arr.reduce(
    (acc, item, i) =>
      acc.concat(
        permutations([...arr.slice(0, i), ...arr.slice(i + 1)]).map(val => [
          item,
          ...val,
        ])
      ),
    []
  );
};
permutations([1, 33, 5]);
// [ [1, 33, 5], [1, 5, 33], [33, 1, 5], [33, 5, 1], [5, 1, 33], [5, 33, 1] ]

const mongoose = require('mongoose')

const UserSchema = new mongoose.Schema({
	username: {
	type: String,
	required: true
	},
	email: {
	type: String,
	unique: true,
	required: true
	},
	password: {
	type: String,
	required: true
	},
	date: {
	type: Date,
	default: Date.now
	}
})

module.exports = User = mongoose.model('user', UserSchema)

var invertTree = function(root) {
    const reverseNode = node => {
        if (node == null) {
            return null
        }
        reverseNode(node.left);
        reverseNode(node.right);
        let holdLeft = node.left;
        node.left = node.right;
        node.right = holdLeft;
        return node;
    }

    return reverseNode(root);
};