Verify if a tree is a binary search tree(BST)

原创转载请注明出处:http://agilestyle.iteye.com/blog/2360893

 

Binary Search Tree

  • any node in left sub-tree < its parent
  • any node in rigth sub-tree > its parent

核心思想:递归

recursively to check values within range

  • recursion, update range for both left and right sub-trees and continue verifying
  • initial range for the root node (Integer.minimal, Integer.maximum)
package org.fool.java.test;

public class VerifyBSTTest {
    public static void main(String[] args) {
        //       4
        //    2     6
        //  1   3  5  7
        Tree myTree = new Tree(4);
        myTree.left = new Tree(2);
        myTree.right = new Tree(6);
        myTree.left.left = new Tree(1);
        myTree.left.right = new Tree(3);
        myTree.right.left = new Tree(5);
        myTree.right.right = new Tree(7);

        System.out.println("My tree is BST? " + ifBST(myTree, Integer.MIN_VALUE, Integer.MAX_VALUE));
    }

    // the key of this algorithm is to keep track of the reasonable range for current focus node and its sub-trees
    // so we need small and large as two range index values
    private static boolean ifBST(Tree a, int small, int large) {
        // firstly check if Tree is a valid tree node or null
        if (a == null) {
            return true;    // if no elements, return true
        }

        // now check if the current tree node is within (small, large)
        if (a.value > small && a.value < large) {
            // call the recursive part to check its' left and right sub-trees
//            boolean leftBST = ifBST(a.left, small, a.value);
//
//            boolean rightBST = false;
//
//            if(leftBST) {   // if leftBST == false, do not need to check the right half
//                rightBST = ifBST(a.right, a.value, large);
//            }
//
//            return rightBST;

            return ifBST(a.left, small, a.value) && ifBST(a.right, a.value, large);
        } else {
            return false;   // which means the current node finds inappropriate node, return false immediately
        }
    }
}

class Tree {
    public int value;
    public Tree left;
    public Tree right;

    public Tree(int value) {
        this.value = value;
        this.left = null;
        this.right = null;
    }
}

Console Output


 

Reference

https://www.youtube.com/watch?v=aNtDir94pcA&list=PLlhDxqlV_-vkak9feCSrnjlrnzzzcopSG&index=44 

https://en.wikipedia.org/wiki/Binary_search_tree 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
【Solution】 To convert a binary search tree into a sorted circular doubly linked list, we can use the following steps: 1. Inorder traversal of the binary search tree to get the elements in sorted order. 2. Create a doubly linked list and add the elements from the inorder traversal to it. 3. Make the list circular by connecting the head and tail nodes. 4. Return the head node of the circular doubly linked list. Here's the Python code for the solution: ``` class Node: def __init__(self, val): self.val = val self.prev = None self.next = None def tree_to_doubly_list(root): if not root: return None stack = [] cur = root head = None prev = None while cur or stack: while cur: stack.append(cur) cur = cur.left cur = stack.pop() if not head: head = cur if prev: prev.right = cur cur.left = prev prev = cur cur = cur.right head.left = prev prev.right = head return head ``` To verify the accuracy of the code, we can use the following test cases: ``` # Test case 1 # Input: [4,2,5,1,3] # Output: # Binary search tree: # 4 # / \ # 2 5 # / \ # 1 3 # Doubly linked list: 1 <-> 2 <-> 3 <-> 4 <-> 5 # Doubly linked list in reverse order: 5 <-> 4 <-> 3 <-> 2 <-> 1 root = Node(4) root.left = Node(2) root.right = Node(5) root.left.left = Node(1) root.left.right = Node(3) head = tree_to_doubly_list(root) print("Binary search tree:") print_tree(root) print("Doubly linked list:") print_list(head) print("Doubly linked list in reverse order:") print_list_reverse(head) # Test case 2 # Input: [2,1,3] # Output: # Binary search tree: # 2 # / \ # 1 3 # Doubly linked list: 1 <-> 2 <-> 3 # Doubly linked list in reverse order: 3 <-> 2 <-> 1 root = Node(2) root.left = Node(1) root.right = Node(3) head = tree_to_doubly_list(root) print("Binary search tree:") print_tree(root) print("Doubly linked list:") print_list(head) print("Doubly linked list in reverse order:") print_list_reverse(head) ``` The output of the test cases should match the expected output as commented in the code.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值