#algorithms
Read more stories on Hashnode
Articles with this tag
530. 二叉搜索树的最小绝对值 function getMinimumDifference(root: TreeNode | null): number { let res = Infinity; let pre = null; const dfs = (node:...
654. 最大二叉树 function constructMaximumBinaryTree(nums: number[]): TreeNode | null { const buildTree = (arr: number[], left: number, right: number)...
513. 找树左下角的值 function findBottomLeftValue(root: TreeNode | null): number { let res = 0; let queue = [root]; while (queue.length) { ...
110. 平衡二叉树 function isBalanced(root: TreeNode | null): boolean { if (root === null) { return true; }; const dfs = (node: TreeNode...
二叉树的最大最小深度已在 Day 14 完成 222. 完全二叉树的节点个数 function countNodes(root: TreeNode | null): number { if (root === null) { return 0; } ...
层序遍历 102. 二叉树的层序遍历 function levelOrder(root: TreeNode | null): number[][] { if (root === null) { return []; } const result = []; ...
