Sword finger offer plan 15 (search and backtracking algorithm medium) — Java


1.1 topic 1

Sword finger offer 54. The k-th node of the binary search tree

1.2 solution

Res and K are set as global variables, and then start traversing the binary search tree,
Because it is a binary search tree, it starts from the right node,
Each traversal determines whether to reach the node.
Each node is -k and knows the arrival node.

1.3 code

class Solution {
    int res,k;
    public int kthLargest(TreeNode root, int k) {
        return res;

    public void dfs(TreeNode root){
        if(root==null) return ;
        if(k==0) return;
        if(--k==0) res=root.val;

2.1 topic 2

Sword finger offer 36. Binary search tree and bidirectional linked list

2.2 solution

Depth first search, start assignment through the front and back nodes,
During search, the node is traversed in middle order. If the node is not empty,
Then the right of the pre node is the current node, and the left of the node is pre
Then the pre node becomes the current node and continues to traverse to the next node

2.3 code

class Solution {
    Node pre, head;
    public Node treeToDoublyList(Node root) {
        if(root == null) return null;
        head.left = pre;
        pre.right = head;
        return head;
    void dfs(Node cur) {
        if(cur == null) return;
        if(pre != null) pre.right = cur;
        else head = cur;
        cur.left = pre;
        pre = cur;

3.1 topic 3

Sword finger offer 34. A path with a certain value in a binary tree

3.2 solution

It’s a bit like going back and adding and subtracting branches
If the leaf node is reached and the route node value is the target value, it will be added to the list

At the end of this step, you need to delete the added value to enter the next stage.

3.3 code

class Solution {
    LinkedList> res = new LinkedList<>();
    LinkedList path = new LinkedList<>(); 
    public List> pathSum(TreeNode root, int sum) {
        recur(root, sum);
        return res;
    void recur(TreeNode root, int tar) {
        if(root == null) return;
        tar -= root.val;
        if(tar == 0 && root.left == null && root.right == null)
            res.add(new LinkedList(path));
        recur(root.left, tar);
        recur(root.right, tar);

Recommended Today

Hive built-in function summary

1. Related help operation functions View built-in functions: Show functions; Display function details: desc function ABS; Display function extension information: desc function extended concat; 2. Learn the ultimate mental method of built-in function Step 1: carefully read all the functions of the show functions command to establish an overall understanding and impression Step 2: use […]