Yosgi
Yosgi
Avatar
😀
3d ai agents ai engineering ai systems algorithms algorithms array binary search tree binary tree css design pattern digital twin digital twins engineering frontend investing investing javascript javascript leetcode life linked list mcp mongodb network node.js performance optimization product engineering projects queue react sorting stack string vue web development web performance
  • As you can see from the previous questions, the recursive methods for front-, middle-, and post-order traversal of a binary tree are similar, but the iterative implementation is completely different. …
    Algorithms Created Sat, 27 Feb 2021 00:00:00 +1300
  • 1h The order of in-order traversal is left - right - center recursion It’s very easy with recursion var postorderTraversal = function(root) { var res = [] if (!root) return res var travel = function …
    Algorithms Created Fri, 26 Feb 2021 00:00:00 +1300
  • 10min The order of pre-order traversal of a binary tree is center-left-right First traverse all root nodes and left nodes, then process the right node It can be seen that this is a recursive behavior. …
    Algorithms Created Thu, 25 Feb 2021 00:00:00 +1300
  • 30min The first thing that comes to mind when I get the question is to sort it directly… But we can optimize the quick sort to get the result Solution 1. Quick sort The idea of quick sort is to find a …
    Algorithms Created Thu, 25 Feb 2021 00:00:00 +1300
  • 30min The order of in-order traversal is left - middle - right recursion It’s very easy with recursion var inorderTraversal = function(root) { var res = [] if (!root) { return res } var travel = …
    Algorithms Created Thu, 25 Feb 2021 00:00:00 +1300
  • Time: 40 minutes ####105. Construct a binary tree from pre-order and in-order traversal sequences recursion Pre-order traversal: center-left-right In-order traversal: left-middle-right Therefore, we …
    Algorithms Created Wed, 27 Jan 2021 00:00:00 +1300