Yosgi
Yosgi
中文
Avatar
😀
6 results for Binary Search Tree
Clear filter

  • 783-Binary Search Tree Node Minimum Distance

    Time: 10 minutes Solve by using the property of pre-order traversal of binary tree var minDiffInBST = function(root) { var min = Infinity var pre = null var dfs = function (root) { if (!root) return …
    Algorithms Created Thu, 18 Mar 2021 00:00:00 +1300

  • 98-Verify Binary Search Tree

    Time: 10 minutes Just use the increasing property of in-order traversal of the binary search tree In-order traversal to find the left child Does pre exist? If not, assign , find the right child, and …
    Algorithms Created Sat, 13 Mar 2021 00:00:00 +1300

  • 99-Restore Binary Search Tree

    Time: 60 minutes The idea is still in-order traversal, using pre to cache the previous node. Because the in-order traversal is incremental, you must find the larger one first and then the smaller one. …
    Algorithms Created Sat, 13 Mar 2021 00:00:00 +1300

  • 450-Delete a node in a binary search tree

    Time: 30 minutes The question is divided into two parts to be solved, search and delete The search part is to find the node. You can find the required node according to the properties of the binary …
    Algorithms Created Thu, 11 Mar 2021 00:00:00 +1300

  • 669-Pruning a Binary Search Tree

    #669. Pruning a binary search tree Release Date: March 11, 2021 Time: 20 minutes Similar to the previous question, most of them are divided into situations where the parent node is in the interval and …
    Algorithms Created Thu, 11 Mar 2021 00:00:00 +1300

  • 1008-Pre-order traversal to construct a binary search tree

    Time: Not done The main reason I didn’t make it was that I kept thinking about how to use a stack. When I looked at the answer to the stack later, I found that recursion was the simplest. recursion …
    Algorithms Created Wed, 10 Mar 2021 00:00:00 +1300