Skip to content

Pattern: Binary Search Tree #118

@sudosf

Description

@sudosf

Objective

Master BST operations and properties from the RisingBrain DSA sheet.

References

Pattern Description

BST property: left < root < right. Inorder traversal of a BST gives elements in sorted order. Use this property to solve search, insertion, deletion, and range queries efficiently.

Sub-issues

# Problem Difficulty
1 Search in a BST Easy
2 Convert Sorted Array to BST Easy
3 Validate Binary Search Tree Medium
4 Delete Node in a BST Medium
5 Kth Smallest Element in a BST Medium
6 Lowest Common Ancestor of a BST Medium

Notes

Language: Java

Metadata

Metadata

Assignees

No one assigned

    Labels

    binary-searchBinary search patterndfsDepth-first searchtreeTree problems

    Projects

    Status
    Backlog

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions