DSA · Theory

Binary Tree Traversal in DS

← All stacks

Theory

200/810

Binary Tree Traversal in DS

Don’t start Binary Tree Traversal in DS with jargon. Start with folder on disk. That is the whole point.

Do Binary Tree Traversal in DS once by hand. left < root < right. Change one input. Say the new result out loud.

Skip Binary Tree Traversal in DS and unbalanced BST becoming a list shows up in a file explorer.

Arun ships Binary Tree Traversal in DS in a file explorer. That is the use case worth saying.

Binary Tree Traversal in DS miss — unbalanced BST becoming a list. Fix it before you talk about advanced DSA.

Place Binary Tree Traversal in DS next to nearby DSA work — left < root < right is the link.

One breath for Binary Tree Traversal in DS, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

Board: folder on disk. Dry-run Binary Tree Traversal in DS. Name the 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))

Binary Tree Traversal in DS — inorder walks left → node → right (sorted order for a BST).

Short notes

DefBinary Tree Traversal in DS — Arun uses it for folder on disk in a file explorer.
RuleBinary Tree Traversal in DS → left < root < right.
RememberBinary Tree Traversal in DS + Big-O (a file explorer).
UseBinary Tree Traversal in DS in a file explorer (folder on disk).
TrapBinary Tree Traversal in DS — unbalanced BST becoming a list.
ExBinary Tree Traversal in DS → 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))

Binary Tree Traversal in DS

Example

Short notes

Questions

Binary Tree Traversal in DS

Example

Short notes

Questions