DSA · Theory

Cartesian tree from inorder traversal

Theory

699/810

Cartesian tree from inorder traversal

Cartesian tree from inorder traversal is a DSA topic. In plain words you use it for folder on disk in a file explorer. Don’t start with a slogan — start with that picture.

Smallest example: left < root < right. Type it, run it, and say what you see. If you can do that from memory, you know Cartesian tree from inorder traversal.

From the example next to this theory: Cartesian tree from inorder traversal — inorder walks left → node → right (sorted order for a BST).

Trap — unbalanced BST becoming a list. Fix that before you talk about advanced DSA.

Viva — what is Cartesian tree from inorder traversal? Then show left < root < right. Then name the trap.

Exam tip

What is Cartesian tree from inorder traversal? Show this: left < root < right. Trap: unbalanced BST becoming a list.

Example

class Node:
    def __init__(self, val, left=None, right=None):
        self.val, self.left, self.right = val, left, right

def inorder(n):
    if not n:
        return []
    return inorder(n.left) + [n.val] + inorder(n.right)

root = Node(2, Node(1), Node(3))
print(inorder(root))

Cartesian tree from inorder traversal — inorder walks left → node → right (sorted order for a BST).

Short notes

DefCartesian tree from inorder traversal — folder on disk in a file explorer.
Ruleleft < root < right
Trapunbalanced BST becoming a list
Usea file explorer

class Node: def __init__(self, val, left=None, right=None): self.val, self.left, self.right = val, left, right def inorder(n): if not n: return [] return inorder(n.left) + [n.val] + inorder(n.right) root = Node(2, Node(1), Node(3)) print(inorder(root))

Cartesian tree from inorder traversal

Example

Short notes

Questions

Cartesian tree from inorder traversal

Example

Short notes

Questions