BST search — inequality walk

Compare — சிறியது left; பெரியது right; None — இல்லை.

Try this in Python

from __future__ import annotations
from dataclasses import dataclass


@dataclass
class TreeNode:
    val: int
    left: TreeNode | None = None
    right: TreeNode | None = None


def search(root: TreeNode | None, x: int) -> bool:
    while root:
        if x == root.val:
            return True
        if x < root.val:
            root = root.left
        else:
            root = root.right
    return False

r = TreeNode(5, TreeNode(3, TreeNode(2), TreeNode(4)), TreeNode(7))
print(search(r, 4), search(r, 6))

Key takeaways

• Iterative — tail recursion.
• Balanced vs skew depth.
• Predecessor logic.