DSA · Theory

Diagonal Traversal of Binary Tree

← All stacks

Theory

160/810

Diagonal Traversal of Binary Tree

Diagonal Traversal of Binary Tree sits in a file explorer. Neha’s job is folder on disk. Write that first.

For Diagonal Traversal of Binary Tree, Big-O is in play. Don’t blame it until you have traced folder on disk.

Diagonal Traversal of Binary Tree exists so Neha can keep folder on disk correct in a file explorer.

Neha ships Diagonal Traversal of Binary Tree in a file explorer. That is the use case worth saying.

Don’t do this with Diagonal Traversal of Binary Tree: unbalanced BST becoming a list. Interviewers spot it in ten seconds.

After Diagonal Traversal of Binary Tree, Neha should still remember unbalanced BST becoming a list.

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

Exam tip

Say Diagonal Traversal of Binary Tree in one breath, then left < root < right, then 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))

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

Short notes

DefDiagonal Traversal of Binary Tree — Neha uses it for folder on disk in a file explorer.
RuleDiagonal Traversal of Binary Tree → left < root < right.
RememberDiagonal Traversal of Binary Tree + Big-O (a file explorer).
UseDiagonal Traversal of Binary Tree in a file explorer (folder on disk).
TrapDiagonal Traversal of Binary Tree — unbalanced BST becoming a list.
ExDiagonal Traversal of 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))

Diagonal Traversal of Binary Tree

Example

Short notes

Questions

Diagonal Traversal of Binary Tree

Example

Short notes

Questions