Leetcode 94: Binary Tree Inorder Traversal

Question: https://leetcode.com/problems/binary-tree-inorder-traversal/ Solution: class Solution { List<Integer> result = new ArrayList<>(); public List<Integer> inorderTraversal(TreeNode root) { traverse(root); return result; } private void traverse(TreeNode root) { if (root != null) {…

Continue reading
Leetcode 226: Invert Binary Tree

Question: https://leetcode.com/problems/invert-binary-tree/ Solution: class Solution { public TreeNode invertTree(TreeNode root) { if (root == null) { return root; } TreeNode temp = root.left; root.left = root.right; root.right = temp; invertTree(root.left);…

Continue reading
Leetcode 617: Merge Two Binary Trees

Question: https://leetcode.com/problems/merge-two-binary-trees/description/ Solution: class Solution { public TreeNode mergeTrees(TreeNode root1, TreeNode root2) { if (root1 == null) { return root2; } if (root2 == null) { return root1; } root1.val…

Continue reading
Leetcode 1379: Find a Corresponding Node of a Binary Tree in a Clone of That Tree

Question: https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/description/ Solution: class Solution { public final TreeNode getTargetCopy(final TreeNode original, final TreeNode cloned, final TreeNode target) { if (original == null) { return null; } if (original.equals(target)) {…

Continue reading
Leetcode 938: Range Sum of BST

Question: https://leetcode.com/problems/range-sum-of-bst/description/ class Solution { int result = 0; public int rangeSumBST(TreeNode root, int low, int high) { traverseTree(root, low, high); return result; } private void traverseTree(TreeNode root, int low,…

Continue reading
How Tesla Fumbled

Wendover's new video that perfectly sums up Tesla's troubles https://www.youtube.com/embed/xpUIZ32n9nw

Continue reading