DSA · Theory

Binary Tree to CDLL

← All stacks

Theory

497/810

Binary Tree to CDLL

Amit only reaches for Binary Tree to CDLL when folder on disk has to stay correct in a file explorer.

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

Without Binary Tree to CDLL, a file explorer gets messy and folder on disk is hard to trust.

Binary Tree to CDLL shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

If folder on disk breaks under Binary Tree to CDLL, check unbalanced BST becoming a list first.

After Binary Tree to CDLL, Amit should still remember unbalanced BST becoming a list.

Close Binary Tree to CDLL with — “If I skip it, folder on disk goes wrong like this: unbalanced BST becoming a list.”

Exam tip

Say Binary Tree to CDLL 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))

Binary Tree to CDLL — inorder walks left → node → right (sorted order for a BST).

Short notes

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

Example

Short notes

Questions

Binary Tree to CDLL

Example

Short notes

Questions