DSA · Theory

Vertical Traversal of a Binary tree

Theory

161/810

Vertical Traversal of a Binary tree

Sara only reaches for Vertical Traversal of a Binary tree when folder on disk has to stay correct in a file explorer.

Vertical Traversal of a Binary tree order: meaning → left < root < right → one limit. Dumping ten features helps nobody.

Vertical Traversal of a Binary tree exists so Sara can keep folder on disk correct in a file explorer.

Sara ships Vertical Traversal of a Binary tree in a file explorer. That is the use case worth saying.

Vertical Traversal of a Binary tree trap: unbalanced BST becoming a list. Sara loses marks for that every viva.

After Vertical Traversal of a Binary tree, Sara should still remember unbalanced BST becoming a list.

One breath for Vertical Traversal of a Binary tree, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

For Vertical Traversal of a Binary tree: definition + a file explorer + one failure.

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))

Vertical Traversal of a Binary tree — inorder walks left → node → right (sorted order for a BST).

Short notes

DefVertical Traversal of a Binary tree — Sara uses it for folder on disk in a file explorer.
RuleVertical Traversal of a Binary tree → left < root < right.
RememberVertical Traversal of a Binary tree + time vs memory (a file explorer).
UseVertical Traversal of a Binary tree in a file explorer (folder on disk).
TrapVertical Traversal of a Binary tree — unbalanced BST becoming a list.
ExVertical Traversal of a Binary tree → folder on disk.

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))

Vertical Traversal of a Binary tree

Example

Short notes

Questions

Vertical Traversal of a Binary tree

Example

Short notes

Questions