DSA · Theory

Print Ancestors of a given node in Binary Tree

Theory

602/810

Print Ancestors of a given node in Binary Tree

Print Ancestors of a given node in Binary Tree sits in a file explorer. Riya’s job is folder on disk. Write that first.

Print Ancestors of a given node in Binary Tree on the board: left < root < right. Then say what folder on disk looks like after.

Skip Print Ancestors of a given node in Binary Tree and unbalanced BST becoming a list shows up in a file explorer.

Riya ships Print Ancestors of a given node in Binary Tree in a file explorer. That is the use case worth saying.

Print Ancestors of a given node in Binary Tree trap: unbalanced BST becoming a list. Riya loses marks for that every viva.

Place Print Ancestors of a given node in Binary Tree next to nearby DSA work — left < root < right is the link.

One breath for Print Ancestors of a given node in Binary Tree, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

Say Print Ancestors of a given node in 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))

Print Ancestors of a given node in Binary Tree — inorder walks left → node → right (sorted order for a BST).

Short notes

DefPrint Ancestors of a given node in Binary Tree — Riya uses it for folder on disk in a file explorer.
RulePrint Ancestors of a given node in Binary Tree → left < root < right.
RememberPrint Ancestors of a given node in Binary Tree + a dry-run table (a file explorer).
UsePrint Ancestors of a given node in Binary Tree in a file explorer (folder on disk).
TrapPrint Ancestors of a given node in Binary Tree — unbalanced BST becoming a list.
ExPrint Ancestors of a given node in 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))

Print Ancestors of a given node in Binary Tree

Example

Short notes

Questions

Print Ancestors of a given node in Binary Tree

Example

Short notes

Questions