ALGODAILY

December 8, 2019

“After all, I was choosing to walk in the front door of Morgan Stanley every day. I didn’t have to. I could make a different choice. I had to stop throwing away my power by focusing on what was wrong and focus on ways, to use a baseball term, “to knock the cover off the ball.”

- Carla Harris

---

Day 99: Binary Tree Inorder Traversal

Can you write a function to traverse a binary tree in-order, and print out the value of each node as it passes?

  4
   \
    5
   /
  6

The example would output [4, 6, 5] since there is no left child for 4, and 6 is visited in-order before 5.

The definition of a tree node is as follows:

function Node(val) {
  this.val = val;
  this.left = null;
  this.right = null;
}

Follow up: you'll likely get the recursive solution first, could you do it iteratively?

Have you seen this question before? We are frequently adding problems and may have updated the order. You can change the day that you're on in the settings panel.

Click to solve →

As always, you can see the solution and a full step by step explanation at this link.

---

AlgoDaily Pick

Looking for a new job?

Take Triplebyte’s quiz and have top tech companies pitch you!

Triplebyte helps programmers find great companies to work at. They’ll go through a technical interview with you, match you with companies that are looking for people with your specific skill sets, and then fast track you through their hiring processes.

Sound good? Take their quiz to get started!

---

One last thing-- if you liked this email, and found value in it, could you kindly forward it to a friend who might benefit?

Our mission is to make tough technical interviews accessible to all, especially those from non-traditional CS backgrounds. I'd deeply appreciate your help in spreading the word!

Thanks,
Jake