DSA · Theory

Get All Descendants of the Binary Tree Element

Theory

314/810

Get All Descendants of the Binary Tree Element

Get All Descendants of the Binary Tree Element is a DSA topic. In plain words you use it for folder on disk in a file explorer. Don’t start with a slogan — start with that picture.

Smallest example: left < root < right. Type it, run it, and say what you see. If you can do that from memory, you know Get All Descendants of the Binary Tree Element.

From the example next to this theory: Get All Descendants of the Binary Tree Element — inorder walks left → node → right (sorted order for a BST).

Trap — unbalanced BST becoming a list. Fix that before you talk about advanced DSA.

Viva — what is Get All Descendants of the Binary Tree Element? Then show left < root < right. Then name the trap.

Exam tip

What is Get All Descendants of the Binary Tree Element? Show this: left < root < right. 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))

Get All Descendants of the Binary Tree Element — inorder walks left → node → right (sorted order for a BST).

Short notes

DefGet All Descendants of the Binary Tree Element — folder on disk in a file explorer.
Ruleleft < root < right
Trapunbalanced BST becoming a list
Usea file explorer

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

Get All Descendants of the Binary Tree Element

Example

Short notes

Questions

Get All Descendants of the Binary Tree Element

Example

Short notes

Questions