haase1020

var isSymmetric = function (root) {
  if (!root) {
    return "no tree was provided 🤔"; // return true
  }
  if (!root.left && !root.right) {
    return "you have a symmetric tree that only has 1 node...the root 🌱!"; // return true
  }
  let queue = [];
  queue.unshift(root);
  queue.unshift(root);

haase1020

//Definition for a binary tree node; needs to be called with "new"
function TreeNode(val) {
    this.val = val;
    this.right = null;
    this.left = null;
}


var sortedArrayToBST = function(nums) {
    // base cases

haase1020

Mandi Haase

mandihaase@gmail.com
(910)354-9330
Alexandria, VA
GitHub | LinkedIn

About Me

I am a full-stack developer by day and educator/ Japanese translator by night. I love creating software, learning, and working with agile teams. I am passionate about getting to the heart of the matter, improving efficiency and productivity, and pretty much everything tech-related. I have vast experience in education and translation, a background in finance, and believe the sky's the limit in what you can achieve if you put your mind to it. In my spare time, you can find me with a good book or power walking.